POJ - 2155 Matrix （二维树状数组）

题目链接：http://poj.org/problem?id=2155点击打开链接

Matrix

Time Limit: 3000MS		Memory Limit: 65536K
Total Submissions: 29167		Accepted: 10642

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

二维树状数组 每次+1 最后mod2就能够查询该点是0还是1

#include <iostream>
#include <queue>
#include <stdio.h>
#include <stdlib.h>
#include <stack>
#include <limits>
#include <string>
#include <string.h>
#include <vector>
#include <set>
#include <map>
#include <algorithm>
#include <math.h>
using namespace std;
#define maxn 1005
int a[maxn][maxn];
int lowbits(int x)
{
    return x&(-x);
}
int getsum(int x,int y)
{
    int ans=0;
    for(int i=x;i>0;i-=lowbits(i))
        for(int j=y;j>0;j-=lowbits(j))
        {
            ans+=a[i][j];
        }
    return ans;
}
void update(int x,int y,int val)
{
    for(int i=x;i<maxn;i+=lowbits(i))
        for(int j=y;j<maxn;j+=lowbits(j))
        {
            a[i][j]+=val;
        }
}
int main(void)
{
    int t;
    int n,m;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d%d",&n,&m);
        for(int i=1;i<=n;i++)
            for(int j=1;j<=n;j++)
                a[i][j]=0;
        while(m--)
        {
            string s;
            cin >> s;
            if(s[0]=='C')
            {
                int x1,x2,y1,y2;
                scanf("%d%d%d%d",&x1,&y1,&x2,&y2);
                if(x1>x2)
                    swap(x1,x2);
                if(y1>y2)
                    swap(y1,y2);
                update(x1,y1,1);
                update(x2+1,y1,-1);
                update(x1,y2+1,-1);
                update(x2+1,y2+1,1);
            }
            else
            {
                int x,y;
                scanf("%d%d",&x,&y);
                int mid=getsum(x,y);
                printf("%d\n",mid%2);
            }
        }
        if(t!=0)
        printf("\n");
    }
    return 0;
}