POJ2155 Matrix（二维树状数组）

#include <iostream>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <queue>
#include <vector>
#include <cstdio>
#define MAXN 1010
int c[MAXN][MAXN],n;
int lowbit(int x)
{
return x&(-x);
}
void update(int x,int y)
{
for(int i=x; i<=n; i+=lowbit(i))
for(int j=y; j<=n; j+=lowbit(j))
c[i][j]++;
}
int getSum(int x,int y)
{
int s=0;
for(int i=x; i>0; i-=lowbit(i))
for(int j=y; j>0; j-=lowbit(j))
s+=c[i][j];
return s;
}
int main()
{
int t,m,x1,x2,y1,y2;
char ch[2];
scanf("%d",&t);
while(t--)
{
memset(c,0,sizeof(c));
scanf("%d%d",&n,&m);
while(m--)
{
scanf("%s",ch);
if(ch[0]=='C')
{
scanf("%d%d%d%d",&x1,&y1,&x2,&y2);
x1++;
y1++;
x2++;
y2++;
update(x2,y2);
update(x1-1,y1-1);
update(x1-1,y2);
update(x2,y1-1);
}
else
{
scanf("%d%d",&x1,&y1);
printf("%d\n",getSum(x1,y1)%2);
}
}
printf("\n");
}
return 0;
}