poj -- 2155 Matrix (二维树状数组)

MatrixTime Limit: 3000MS Memory Limit: 65536K
Total Submissions: 9076 Accepted: 3411


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

 

题意：

提供一个M*N的矩阵，其中每一个格子中的数不是1就是0，初

始时每一个格子的值为0，我们可以修改这个矩阵中的数字，每次给

出矩阵的左上角坐标(x,y)，以及右下角的坐标(x, y)，并且将矩
   
阵中的数字全部取反（原来是1现在变成0，原来是0现在变成1）,

还可以每次查询第x行第y列的格子中的数字是什么。

分析：

根据这个题目中介绍的这个矩阵中的数的特点不是1就是0，这

样我们只需记录每个格子改变过几次，即可判断这个格子的数字。

 

 

 

 

 

 

 // 4052K 500MS #include <iostream> using namespace std; const int N = 1005; int c[N][N]; int Row, Col; inline int Lowbit(const int &x){// x > 0 return x&(-x); } int Sum(int i, int j){ int tempj, sum = 0; while( i > 0 ){ tempj = j; while( tempj > 0 ){ sum += c[i][tempj]; tempj -= Lowbit(tempj); } i -= Lowbit(i); } return sum; } void Update(int i, int j, int num){ int tempj; while( i <= Row ){ tempj = j; while( tempj <= Col ){ c[i][tempj] += num; tempj += Lowbit(tempj); } i += Lowbit(i); } } int main() { int t,n,a,b,e,f,s,i,j; char q[3]; scanf("%d",&t); while (t--) { memset(c,0,sizeof(c)); scanf("%d%d",&n,&s); Row=Col=n; while (s--) { scanf("%s %d %d",&q,&a,&b); if(q[0]=='C') { scanf("%d%d",&e,&f); Update(a,b,1); Update(a,f+1,1); Update(e+1,f+1,1); Update(e+1,b,1); } else { printf("%d/n",Sum(a,b)&1); } } if(t!=0) printf("/n"); } }