hdu 3584 Cube

 

                     Cube

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 131072/65536 K (Java/Others)
Total Submission(s): 448    Accepted Submission(s): 203

Problem Description

Given an N*N*N cube A, whose elements are either 0 or 1. A[i, j, k] means the number in the i-th row , j-th column and k-th layer. Initially we have A[i, j, k] = 0 (1 <= i, j, k <= N).
We define two operations, 1: “Not” operation that we change the A[i, j, k]=!A[i, j, k]. that means we change A[i, j, k] from 0->1,or 1->0. (x1<=i<=x2,y1<=j<=y2,z1<=k<=z2).
0: “Query” operation we want to get the value of A[i, j, k].

 

 

Input

Multi-cases.
First line contains N and M, M lines follow indicating the operation below.
Each operation contains an X, the type of operation. 1: “Not” operation and 0: “Query” operation.
If X is 1, following x1, y1, z1, x2, y2, z2.
If X is 0, following x, y, z.

 

 

Output

For each query output A[x, y, z] in one line. (1<=n<=100 sum of m <=10000)

 

 

Sample Input

  
  

   
   2 5
1 1 1 1  1 1 1
0 1 1 1
1 1 1 1  2 2 2
0 1 1 1
0 2 2 2
  
  

 

 

Sample Output

  
  

   
   1
0
1
  
  
  
  

  
  

  
  

  
  

   
   代码如下（水过）：
  
  
  
  

   
   #include<stdio.h>
#include<string.h>
struct node 
{
    int x1,x2;
    int y1,y2;
    int z1,z2;
}p[10010];

int main()
{
    int n,m;
    int x1,y1,z1;

    while(scanf("%d%d",&n,&m)!=EOF)
    {
        int l=0;

        while(m--)
        {
            int flag;
            scanf("%d",&flag);
            if(flag==1)
            {
                scanf("%d%d%d%d%d%d",&p[l].x1,&p[l].y1,&p[l].z1,&p[l].x2,&p[l].y2,&p[l].z2);
                l++;
            }
            else if(flag==0)
            {
                scanf("%d%d%d",&x1,&y1,&z1);
                int count=0;
                for(int i=0;i<l;i++)
                    if(p[i].x1<=x1&&x1<=p[i].x2&&p[i].y1<=y1&&y1<=p[i].y2&&p[i].z1<=z1&&z1<=p[i].z2)
                                count+=1;
                if(count%2==0)
                    printf("0/n");
                else
                    printf("1/n");
            }
        }
    }
    return 0;
}