Cube
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/65536 K (Java/Others)
Total Submission(s): 1983 Accepted Submission(s): 1033
Problem Description
Given an N*N*N cube A, whose elements are either 0or1. A[i, j, k] means thenumberinthe 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] from0->1,or1->0. (x1<=i<=x2,y1<=j<=y2,z1<=k<=z2).
0: “Query” operation we want togetthevalueof A[i, j, k].
Input
Multi-cases.
First linecontains N and M, M lines follow indicating the operation below.
Each operation containsan X, the type of operation. 1: “Not” operation and0: “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] inoneline. (1<=n<=100sumof m <=10000)
Sample Input
2511111110111111122201110222
Sample Output
101
Author
alpc32
Source
2010 ACM-ICPC Multi-University Training Contest(15)——Host by NUDT