多维树状数组

Cube

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/65536 K (Java/Others)

Total Submission(s): 174 Accepted Submission(s): 90

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  先举个一维的例子： 你要使区间[x,y]全部加上一个值v,结合树状数组的功能，在x处加v, y+1处减v，这样如果你要求x处的值，就转换成求[1,x]的和了。 例如 ：一个n=6的数组，一开始为0  0  0   0  0  0在[2,4]加上2后变成   0   2   0   0   -2    0   这样前缀和 sum[1]=0;sum[2]=2;sum[3]=2;sum[4]=2;sum[5]=0;sum[6]=0;依次代表了每个数的值。 二维的也一样，因为二维树状数组的getsum(int x,int y)函数是求矩阵（1,1）~(x,y)的值得和，也就类似于前缀和，原理和一维的一样 只不过线操作改成了平面操作。                        add(x,y,1);                 add(x,y1+1,-1);                 add(x1+1,y,-1);                 add(x1+1,y1+1,1);                然后查询单点就是求和了。 #include <iostream> #include <stdio.h> #include <string.h> #include <vector> #include <algorithm> using namespace std; const int N = 105; // 位置 int bit[N][N][N]; int lowbit(int x) { return x & (-x); } int query(int x, int y, int z) { int s = 0; for (int i = x; i > 0; i -= lowbit(i)) { for (int j = y; j > 0; j -= lowbit(j)) { for (int k = z; k > 0; k -= lowbit(k)) { s += bit[i][j][k]; } } } return s & 0x1; } void add(int x, int y, int z) { for (int i = x; i < N; i += lowbit(i)) { for (int j = y; j < N; j += lowbit(j)) { for (int k = z; k < N; k += lowbit(k)) { bit[i][j][k]++; } } } } int main() { //freopen("in.txt", "r", stdin); int n, m; while (~scanf("%d%d", &n, &m)) { memset(bit, 0, sizeof(bit)); for (int i = 0; i < m; i++) { int op; scanf("%d", &op); int x, y, z; int x1, y1, z1, x2, y2, z2; if (op == 1) { scanf("%d%d%d%d%d%d", &x1, &y1, &z1, &x2, &y2, &z2); x2++; y2++; z2++; add(x1, y1, z1); add(x1, y2, z1); add(x1, y1, z2); add(x1, y2, z2); add(x2, y1, z1); add(x2, y2, z1); add(x2, y1, z2); add(x2, y2, z2); } else if (op == 0) { scanf("%d%d%d", &x, &y, &z); printf("%d\n", query(x, y, z)); } } } }