HDU 3584 Cube --三维树状数组

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <algorithm>
using namespace std;

int c[105][105][105];
int n;

int lowbit(int x) { return x & (-x); }

void modify(int x,int y,int z,int val)
{
    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))
                c[i][j][k] += val;
}

int getsum(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 q,op;
    int x,y,z,x1,y1,z1,x2,y2,z2;
    while(scanf("%d%d",&n,&q)!=EOF)
    {
        memset(c,0,sizeof(c));
        while(q--)
        {
            scanf("%d",&op);
            if(op == 1)
            {
                scanf("%d%d%d%d%d%d",&x1,&y1,&z1,&x2,&y2,&z2);
                modify(x1,y1,z1,1);
                modify(x1,y1,z2+1,-1);
                modify(x1,y2+1,z1,-1);
                modify(x1,y2+1,z2+1,1);
                modify(x2+1,y1,z1,-1);
                modify(x2+1,y1,z2+1,1);
                modify(x2+1,y2+1,z1,1);
                modify(x2+1,y2+1,z2+1,-1);
            }
            else
            {
                scanf("%d%d%d",&x,&y,&z);
                int sum = getsum(x,y,z);
                printf("%d\n",sum%2);
            }
        }
    }
    return 0;
}