【poj2155】【二维树状数组】Matrix

Matrix

Time Limit: 3000MS Memory Limit: 65536K
Total Submissions: 25306 Accepted: 9381

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

还是树状数组的裸题，理解起来其实比较简单，算起来就加一个平方的复杂度，还是很低，具体我就不讲了，还是安利一篇文章（虽然别人也是转的）：http://blog.csdn.net/z309241990/article/details/9615259

然后贴代码：

#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<set>
#include<map>
#include<queue>
#include<algorithm>
#include<vector>
#include<cstdlib>
#include<cmath>
#include<ctime>
#include<stack>
#define INF 2100000000
#define ll long long
#define clr(x)  memset(x,0,sizeof(x))
#define clrmax(x)  memset(x,127,sizeof(x))

using namespace std;

inline int read()
{
    char c;
    int ret=0;
    while(!(c>='0'&&c<='9'))
        c=getchar();
    while(c>='0'&&c<='9')
    {
        ret=(c-'0')+(ret<<1)+(ret<<3);
        c=getchar();
    }
    return ret;
}

#define M 1005
#define lowbit(x) (x&(-x))

int tree[M][M],a[M][M],t,n,m;

void add(int x,int y)
{
    for(int i=x;i;i-=lowbit(i))
        for(int j=y;j;j-=lowbit(j))
            tree[i][j]++;
}

int find(int x,int y)
{
    int ret=0;
    for(int i=x;i<=n;i+=lowbit(i))
        for(int j=y;j<=n;j+=lowbit(j))
            ret+=tree[i][j];
    return ret;
}

int main()
{
    freopen("in.txt","r",stdin);
    t=read();
    while(t--)
    {
        clr(tree);
        n=read(),m=read();
        while(m--)
        {
            char s[10];
            scanf("%s",s);
            if(s[0]=='C')
            {
                int x1=read(),y1=read(),x2=read(),y2=read();
                add(x2,y2);
                add(x1-1,y1-1);
                add(x1-1,y2);
                add(x2,y1-1);
            }
            else
            {
                int x=read(),y=read();
                printf("%d\n",find(x,y)%2);
            }
        }
        cout<<'\n';
    }
    return 0;
}

大概就是这个样子，如果有什么问题，或错误，请在评论区提出，谢谢。