HDU 3584-Cube（三维BIT）

#include <map>
#include <set>
#include <list>
#include <cmath>
#include <queue>
#include <stack>
#include <cstdio>
#include <vector>
#include <string>
#include <cctype>
#include <complex>
#include <cassert>
#include <utility>
#include <cstring>
#include <cstdlib>
#include <iostream>
#include <algorithm>
using namespace std;
typedef pair<int,int> PII;
typedef long long ll;
#define lson l,m,rt<<1
#define pi acos(-1.0)
#define rson m+1,r,rt<<11
#define All 1,N,1
#define read freopen("in.txt", "r", stdin)
#define N 110
const ll  INFll = 0x3f3f3f3f3f3f3f3fLL;
const int INF= 0x7ffffff;
const int mod =  1000000007;
int a[N][N][N],n,m;
int lowbit(int x){
    return x&(-x);
}
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=k+lowbit(k))
        a[i][j][k]++;//统计奇偶性+1，-1一样
}
int sum(int x,int y,int z){
    int num=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))
        num+=a[i][j][k];
    return num;
}
int main()
{
    int op,x1,y1,z1,x2,y2,z2;
    while(~scanf("%d%d",&n,&m)){
        memset(a,0,sizeof(a));
        while(m--){
        scanf("%d",&op);
        if(op==1){
            scanf("%d%d%d%d%d%d",&x1,&y1,&z1,&x2,&y2,&z2);
            add(x1,y1,z1);
            add(x1,y1,z2+1);
            add(x2+1,y1,z1);
            add(x1,y2+1,z1);
            add(x2+1,y2+1,z1);
            add(x2+1,y1,z2+1);
            add(x1,y2+1,z2+1);
            add(x2+1,y2+1,z2+1);
        }
        else{
            scanf("%d%d%d",&x1,&y1,&z1);
            printf("%d\n",sum(x1,y1,z1)%2);
        }
      }
    }
return 0;
}