传送门:http://poj.org/problem?id=2155
题意:给你一个N*N的矩阵,初始化每个格子都是0,给你两种操作,C :翻转操作,以这两点围成的矩形内数字进行翻转(0变1,1变0);Q:询问某一格子所对应的值
分析:典型的树状数组
#include<iostream>
#include <cstdio>
#include <cstring>
using namespace std;
const int maxn = 1005;
int sum[maxn][maxn],n;
int T;
inline int lowbit(int x)
{
return (x&-x);
}
void Change(int x,int y,int delta)
{
int ty = y;
while(x<=n)
{
y = ty;
while(y<=n)
{
sum[x][y] += delta;
//printf("sum[%d][%d] == %d\n",x,y,sum[x][y]);
y+=lowbit(y);
}
x += lowbit(x);
}
}
int Query(int x,int y)
{
int ty = y,ans = 0;
while(x)
{
y = ty;
while(y)
{
ans += sum[x][y];
y -= lowbit(y);
}
x -= lowbit(x);
}
return ans;
}
int main()
{
int cas;
scanf("%d",&cas);
for(int k = 0;k<cas;k++)
{
if(k!=0) printf("\n");
scanf("%d %d",&n,&T);
memset(sum,0,sizeof(sum));
for(int i=1; i<=T; i++)
{
char ch;
int x1,y1,x2,y2;
scanf(" %c",&ch);
// printf("c === %c\n",ch);
if(ch == 'C')
{
scanf("%d %d %d %d",&x1,&y1,&x2,&y2);
// printf("%d %d %d %d-------mid\n",x1,y1,x2,y2);
Change(x1,y1,1);
Change(x1,y2+1,1);
Change(x2+1,y1,1);
Change(x2+1,y2+1,1);
}
else
{
scanf("%d %d",&x1,&y1);
printf("%d\n",Query(x1,y1)&1);
}
}
}
return 0;
}