###### Matrix(二维）
 Time Limit: 3000MS Memory Limit: 65536K Total Submissions: 31525 Accepted: 11474

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

#include<stdio.h>
#include<iostream>
#include<string.h>
using namespace std;

const int maxn=1010;
int c[maxn][maxn];
int n,m;
int lowbit(int x)
{
return x&(-x);
}
void updata(int pos1,int pos2)
{
for(int i=pos1;i<=n;i+=lowbit(i))
{
for(int j=pos2;j<=n;j+=lowbit(j))
c[i][j]++;
}
}
int getsum(int pos1,int pos2)
{
int sum=0;
for(int i=pos1;i>0;i-=lowbit(i))
for(int j=pos2;j>0;j-=lowbit(j))
sum+=c[i][j];
return sum;
}
int main()
{
int t;
scanf("%d",&t);
while(t--)
{
memset(c,0,sizeof(c));
scanf("%d%d",&n,&m);
while(m--){
char s[5];
scanf("%s",s);
int x1,y1,x2,y2;

if(s[0]=='C')
{
scanf("%d%d%d%d",&x1,&y1,&x2,&y2);
updata(x2+1,y2+1);
updata(x1,y1);
updata(x2+1,y1);
updata(x1,y2+1);
}
else
{
scanf("%d%d",&x1,&y1);
printf("%d\n",getsum(x1,y1)%2);
}
}
if(t) printf("\n");
}
}

#### Leetcode 240 Search a 2D Matrix II （二分法和分治法解决有序二维数组查找）

2015-07-23 20:41:07

#### POJ 2155 Matrix(二维树状数组，绝对详细)

2015-07-09 16:49:49

#### 免费在线二维DataMatrix码生成器

2016-08-17 09:41:50

#### UVA 11019 Matrix Matcher（二维矩阵匹配ac自动机）

2015-10-16 16:00:47

#### Matrix Derivative矩阵求导

2018-04-06 12:53:36

#### poj2155 Matrix（经典二维树状数组）

2017-03-04 13:37:13

#### 二维线段树（Matrix，poj 2155）

2016-12-12 11:20:50

#### Matrix--集合--点二维排序

2013-03-12 15:50:32

#### C++ 二维动态数组创建及越界问题

2016-04-06 21:26:41

#### PDF417二维条码／二维码

2008-01-09 12:31:00

Matrix(二维）