POJ2155:Matrix(二维树状数组，经典)

http://blog.csdn.net/libin56842/article/details/46620445

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

Source

POJ Monthly,Lou Tiancheng

这道题确实很经典，尤其在这个二进制的计算方面

详细的可以参考 《浅谈信息学竞赛中的“0”和“1”》此论文，网上很多说的并不详细，大多只介绍了翻转，并没有介绍为何sum(x,y)%2能得到结果

论文里很详细的证明了

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

[cpp]  view plain copy

1. #include <iostream>  
2. #include <stdio.h>  
3. #include <string.h>  
4. #include <string>  
5. #include <stack>  
6. #include <queue>  
7. #include <map>  
8. #include <set>  
9. #include <vector>  
10. #include <math.h>  
11. #include <bitset>  
12. #include <list>  
13. #include <algorithm>  
14. #include <climits>  
15. using namespace std;  
16.   
17. #define lson 2*i  
18. #define rson 2*i+1  
19. #define LS l,mid,lson  
20. #define RS mid+1,r,rson  
21. #define UP(i,x,y) for(i=x;i<=y;i++)  
22. #define DOWN(i,x,y) for(i=x;i>=y;i--)  
23. #define MEM(a,x) memset(a,x,sizeof(a))  
24. #define W(a) while(a)  
25. #define gcd(a,b) __gcd(a,b)  
26. #define LL long long  
27. #define N 1005  
28. #define INF 0x3f3f3f3f  
29. #define EXP 1e-8  
30. #define lowbit(x) (x&-x)  
31. const int mod = 1e9+7;  
32.   
33. int c[N][N],n,m,cnt,s,t;  
34. int a[N][N];  
35.   
36.   
37. int sum(int x,int y)  
38. {  
39.     int ret = 0;  
40.     int i,j;  
41.     for(i = x;i>=1;i-=lowbit(i))  
42.     {  
43.         for(j = y;j>=1;j-=lowbit(j))  
44.         {  
45.             ret+=c[i][j];  
46.         }  
47.     }  
48.     return ret;  
49. }  
50.   
51. void add(int x,int y)  
52. {  
53.     int i,j;  
54.     for(i = x;i<=n;i+=lowbit(i))  
55.     {  
56.         for(j = y;j<=n;j+=lowbit(j))  
57.         {  
58.             c[i][j]++;  
59.         }  
60.     }  
61. }  
62.   
63. int main()  
64. {  
65.     int i,j,x,y,ans,t;  
66.     int x1,x2,y1,y2;  
67.     char op[10];  
68.     scanf("%d",&t);  
69.     while(t--)  
70.     {  
71.         scanf("%d%d",&n,&m);  
72.         MEM(c,0);  
73.         MEM(a,0);  
74.         while(m--)  
75.         {  
76.             scanf("%s",op);  
77.             if(op[0]=='C')  
78.             {  
79.                 scanf("%d%d%d%d",&x1,&y1,&x2,&y2);  
80.                 x1++,y1++,x2++,y2++;  
81.                 add(x2,y2);  
82.                 add(x1-1,y1-1);  
83.                 add(x2,y1-1);  
84.                 add(x1-1,y2);  
85.             }  
86.             else  
87.             {  
88.                 scanf("%d%d",&x1,&y1);  
89.                 x2 = x1,y2 = y1;  
90.                 x1++,y1++,x2++,y2++;  
91.                 printf("%d\n",sum(x1,y1));  
92.             }  
93.         }  
94.         printf("\n");  
95.     }  
96.   
97.     return 0;  
98. }