POJ 2155

#include<cstdio>
#include<cstring>
#include<iostream>
using namespace std;
const int M=1010;
int n,sum[M][M];
void change(int x,int y){
	int i,j;
	for(i=x;i>0;i-=(i&-i))
		for(j=y;j>0;j-=(j&-j))
			sum[i][j]^=1;
}
int query(int x,int y){
	int i,j,s=0;
	for(i=x;i<=n;i+=(i&-i))
		for(j=y;j<=n;j+=(j&-j))
			s+=sum[i][j];
	return s;
}
int main(){
	char c;
	int i,q,x1,y1,x2,y2,kase;
	cin>>kase;
	while(kase--){
		cin>>n>>q;
		memset(sum,0,sizeof(sum));
		for(i=1;i<=q;i++){
			scanf("\n%c",&c);
			if(c=='C'){
				cin>>x1>>y1>>x2>>y2;
				change(x1-1,y1-1);
				change(x2,y1-1);
				change(x1-1,y2);
				change(x2,y2);
			}
			if(c=='Q'){
				cin>>x1>>y1;
				cout<<query(x1,y1)%2<<endl;
			}
		}
		printf("\n"); 
	}
	return 0;
}