ACM PKU 2155 Matrix（树状数组）

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

思路 ： 这个题目中范围修改单点查询，典型的树状数组应用之一。所以用2维树状数组。

#include <cstdio>
#include <queue>
#include <map>
#include <cmath>
#include <string>
#include <cstring>
#include <algorithm>
using namespace std;

int m,n;
int sum[1042][1042];
int lowBit(int x)
{
    return (x&(-x));
}

void update(int x,int y,int val)
{
    for(int i = x; i <= n; i+= lowBit(i))
    for(int j = y; j <= n; j+= lowBit(j))
         sum[i][j] += val;
}

int getSum(int x,int y)
{
    int s = 0;
    for(int i = x; i >= 1; i-= lowBit(i))
    for(int j = y; j >= 1; j-= lowBit(j))
        s += sum[i][j];
    return s;
}
int main()
{
    int t;
    scanf("%d",&t);
    for(int k = 1; k <= t; k++)
    {
        if(k != 1) printf("\n");
        memset(sum,0,sizeof(sum));
        scanf("%d%d",&n,&m);
        for(int i = 0; i < m; i++)
        {
            char s[10];
            int x1,x2,y1,y2;
            scanf("%s",s);
            if(s[0] == 'C')
            {
                scanf("%d%d%d%d",&x1,&y1,&x2,&y2);
                update(x1,y1,1); // 这里和一维里add（l，1），add（r，-1）1个道理。
                update(x2+1,y1,-1);
                update(x1,y2+1,-1);
                update(x2+1,y2+1,1);
            }
            else
            {
                scanf("%d%d",&x1,&y1);
                printf("%d\n",getSum(x1,y1)%2);//这里将翻转问题转换为奇数偶数问题。
            }
        }
    }
      return 0;
}