hdu 3584 Cube 三维树状数组更新查找

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<cstdio>
#include<iostream>
#include<algorithm>
#include<string.h>
using namespace std;
int c[105][105][105];
int n;
int lowbit(int x)
{
    return x&-x;
}
void update(int x,int y,int z,int k)
{
    for(int i=x; i<=n; i+=lowbit(i))
        for(int j=y; j<=n; j+=lowbit(j))
            for(int l=z; l<=n; l+=lowbit(l))
            {
                c[i][j][l]+=k;
            }
}
int sum(int x,int y,int z)
{
    int sum=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))
            {
                sum+=c[i][j][k];
            }
    return sum;
}
int main()
{
    int m;
    int x2,x1,y2,y1,z2,z1,k;
    while(~scanf("%d %d",&n,&m))
    {
        memset(c,0,sizeof(c));
        for(int i=0; i<m; i++)
        {
            scanf("%d %d %d %d",&k,&x1,&y1,&z1);
            if(k==0)
                printf("%d\n",sum(x1,y1,z1)%2);
            else
            {
                scanf("%d %d %d",&x2,&y2,&z2);
                update(x1,y1,z1,1);
                update(x1,y1,z2+1,1);
                update(x1,y2+1,z1,1);
                update(x1,y2+1,z2+1,1);
                update(x2+1,y1,z1,1);
                update(x2+1,y1,z2+1,1);
                update(x2+1,y2+1,z1,1);
                update(x2+1,y2+1,z2+1,1);
            }
        }
    }
    return 0;
}