POJ2155 Matrix 树状数组

二维的树状数组，解题思想详见《浅谈信息学竞赛中的“0”和“1”》这篇论文，我上传了一份

http://download.csdn.net/detail/lenleaves/4548401

。很经典的题目，很经典的思想。

Matrix

Time Limit: 3000MS		Memory Limit: 65536K
Total Submissions: 12826		Accepted: 4808

Description

Given an N*N matrix A, whose elements are either 0 or 1. A[i, j] means the number in the i-th row and j-th column. Initially we have A[i, j] = 0 (1 <= i, j <= N).

We can change the matrix in the following way. Given a rectangle whose upper-left corner is (x1, y1) and lower-right corner is (x2, y2), we change all the elements in the rectangle by using "not" operation (if it is a '0' then change it into '1' otherwise change it into '0'). To maintain the information of the matrix, you are asked to write a program to receive and execute two kinds of instructions.

1. C x1 y1 x2 y2 (1 <= x1 <= x2 <= n, 1 <= y1 <= y2 <= n) changes the matrix by using the rectangle whose upper-left corner is (x1, y1) and lower-right corner is (x2, y2).
2. Q x y (1 <= x, y <= n) querys A[x, y].

Input

The first line of the input is an integer X (X <= 10) representing the number of test cases. The following X blocks each represents a test case.

The first line of each block contains two numbers N and T (2 <= N <= 1000, 1 <= T <= 50000) representing the size of the matrix and the number of the instructions. The following T lines each represents an instruction having the format "Q x y" or "C x1 y1 x2 y2", which has been described above.

Output

For each querying output one line, which has an integer representing A[x, y].

There is a blank line between every two continuous test cases.

Sample Input

1
2 10
C 2 1 2 2
Q 2 2
C 2 1 2 1
Q 1 1
C 1 1 2 1
C 1 2 1 2
C 1 1 2 2
Q 1 1
C 1 1 2 1
Q 2 1

Sample Output

1
0
0
1

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<string>
#include<bitset>

using namespace std;

#define MAXN 1100

int c[MAXN][MAXN];
int n,q;

void init()
{
	for(int i=1;i<=n;i++)
		for(int j=1;j<=n;j++)
			c[i][j]=0;
}

int lowbit(int t)
{
	return t&(-t);
}

int sum(int x,int y)
{
	int s=0,i=1;
	while(x>0)
	{
		i=y;
		while(i>0)
		{
			s+=c[x][i];
			i-=lowbit(i);
		}
		x-=lowbit(x);
	}
	return s;	
}

void modify(int x,int y,int s)
{
	while(x<=n)
	{
		int i=y;
		while(i<=n)
		{
			c[x][i]+=s;
			i+=lowbit(i);
		}
		x+=lowbit(x);
	}	
}

void solve()
{
	int x1,y1,x2,y2;
	char a[20];
	scanf("%d%d",&n,&q);
	init();
	for(int i=1;i<=q;i++)
	{
		scanf("%s",a);
		if(a[0]=='C') 
		{
			scanf("%d%d%d%d",&x1,&y1,&x2,&y2);
			modify(x1,y1,1);
			modify(x1,y2+1,1);
			modify(x2+1,y1,1);
			modify(x2+1,y2+1,1);
		}
		else
		{
			scanf("%d%d",&x1,&y1);
			printf("%d\n",sum(x1,y1)%2);
		}
	}
}

int main()
{
	int t;
	scanf("%d",&t);
	while(t--)
	{
		solve();
		if(t) printf("\n");
	}
	return 0; 
}