POJ 2155 Matrix(二维树状数组模板)

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int MAX=1000+10;
int sum[MAX][MAX];
int 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))
{
sum[i][j]++;
}
}
}
int query(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+=sum[i][j];
}
}
return s;
}
int main()
{
//freopen("in.txt","r",stdin);
//freopen("out.txt","w",stdout);
int T;
scanf("%d",&T);
while(T--)
{
memset(sum,0,sizeof(sum));
int t;
scanf("%d%d",&N,&t);
char C;
while(t--)
{
getchar();
scanf("%c",&C);
int a,b,c,d;
if(C=='Q')
{
scanf("%d%d",&a,&b);
printf("%d\n",query(a,b)%2);
}
if(C=='C')
{
scanf("%d%d%d%d",&a,&b,&c,&d);
update(a,b);
update(c+1,b);
update(a,d+1);
update(c+1,d+1);
}
}
putchar(10);
}
return 0;
}