例题:
Problem E
Time Limit : 2000/1000ms (Java/Other) Memory Limit : 131072/65536K (Java/Other)
Total Submission(s) : 22 Accepted Submission(s) : 12
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].
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
1 0 1
代码如下:
#include<iostream>
#include<stdio.h>
#include<string.h>
#include<algorithm>
#define M 102
using namespace std;
int c[M][M][M];
int lowbit(int x)
{
return x&(-x);
}
void add(int x,int y,int z,int v)
{ for(int k=z;k<=101;k+=lowbit(k))
for(int i=x;i<=101;i+=lowbit(i))
{
for(int j=y;j<=101;j+=lowbit(j))
c[k][i][j]+=v;
}
}
long long sum(int x,int y,int z)
{
long long su=0;
for(int k=z;k>0;k-=lowbit(k))
for(int i=x;i>0;i-=lowbit(i))
{
for(int j=y;j>0;j-=lowbit(j))
su+=c[k][i][j];
}
return su;
}
int main()
{
int t,k;
int x,y,z,x1,y1,z1;
int m;
while(~scanf("%d%d",&t,&m))
{
memset(c,0,sizeof(c));
for(int i=1;i<=m;i++)
{
cin>>k;
if(k==1)
{
cin>>x>>y>>z>>x1>>y1>>z1;
add(x,y,z,1);
add(x1+1,y1+1,z1+1,-1);
add(x,y,z1+1,-1);
add(x1+1,y,z,-1);
add(x,y1+1,z,-1);
add(x1+1,y,z1+1,1);
add(x,y1+1,z1+1,1);
add(x1+1,y1+1,z,1);
}
else if(k==0)
{
cin>>x>>y>>z;
cout<<sum(x,y,z)%2<<endl;
}
}
}
return 0;
}