POJ2155~Matrix（二维树状数组+思路）

Matrix

Time Limit: 3000MS		Memory Limit: 65536K
Total Submissions: 27225		Accepted: 9965

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

这题主要难点在于如何判断一个点是否改变过，参考这个链接 参考，用区间和判断此点是否反转；

树状数组虽与此不尽相同，但原理是类似的，参考中直接将开头和结尾+1，而树状数组则是将这一大段区间分成若干个小区间，在小区间的开头和结尾+1；

t数组表示的是1~(x,y)矩阵的状态，即为0或1，0表示不变，1表示与原本取反；

则往树状数组中加入关系时，每次判断矩阵的状态，具体见代码

方法一：改上界，求下界

#include <iostream>
#include <iomanip>
#include<stdio.h>
#include<string.h>
#include<stack>
#include<stdlib.h>
#include<queue>
#include<map>
#include<math.h>
#include<algorithm>
#include<vector>
using namespace std;
int t[1005][1005];
int n,m;
int lowbit(int x)
{
    return x&-x;
}
void add(int x,int y)
{
    for(int i=x;i<=n;i+=lowbit(i))
    {
        for(int j=y;j<=n;j+=lowbit(j))
        {
            t[i][j]=(t[i][j]+1)&1;//取反
        }
    }
}
int read(int x,int y)
{
    int sum=0;
    for(int i=x;i>0;i-=lowbit(i))
    {
        for(int j=y;j>0;j-=lowbit(j))
        {
            sum+=t[i][j];
        }
    }
    return sum&1;
}
int main()
{
    int T;
    scanf("%d",&T);
    while(T--)
    {
        scanf("%d%d",&n,&m);
        memset(t,0,sizeof(t));
        char op;
        int x,y,x1,y1,x2,y2;
        for(int i=1;i<=m;i++)
        {
            cin>>op;
            if(op=='C')
            {
                scanf("%d%d%d%d",&x1,&y1,&x2,&y2);
                //二次取反等于不改变
                add(x2+1,y2+1);
                add(x1,y2+1);
                add(x2+1,y1);
                add(x1,y1);
            }
            else
            {
                scanf("%d%d",&x,&y);
                printf("%d\n",read(x,y));
            }
        }

puts("");

    }
    return 0;
}

方法二：改下界，求上界

#include <iostream>
#include <iomanip>
#include<stdio.h>
#include<string.h>
#include<stack>
#include<stdlib.h>
#include<queue>
#include<map>
#include<math.h>
#include<algorithm>
#include<vector>
using namespace std;
int t[1005][1005];
int n,m;
int lowbit(int x)
{
    return x&-x;
}
void add(int x,int y)
{
    for(int i=x;i>0;i-=lowbit(i))
    {
        for(int j=y;j>0;j-=lowbit(j))
        {
            t[i][j]=(t[i][j]+1)&1;//取反
        }
    }
}
int read(int x,int y)
{
    int sum=0;
    for(int i=x;i<=n;i+=lowbit(i))
    {
        for(int j=y;j<=n;j+=lowbit(j))
        {
            sum+=t[i][j];
        }
    }
    return sum&1;
}
int main()
{
    int T;
    scanf("%d",&T);
    while(T--)
    {
        scanf("%d%d",&n,&m);
        memset(t,0,sizeof(t));
        char op;
        int x,y,x1,y1,x2,y2;
        for(int i=1;i<=m;i++)
        {
            cin>>op;
            if(op=='C')
            {
                scanf("%d%d%d%d",&x1,&y1,&x2,&y2);
              add(x2,y2);
              add(x1-1,y1-1);
              add(x1-1,y2);
              add(x2,y1-1);

            }
            else
            {
                scanf("%d%d",&x,&y);
                printf("%d\n",read(x,y));
            }
        }

puts("");

    }
    return 0;
}