Matrix
| Time Limit: 3000MS | Memory Limit: 65536K | |
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].
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.
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.
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
题目大意：
n*n矩阵
一次访问一个子矩阵
一次询问一个点的访问次数%2
二维线段树
#include<cstdio> #include<cstring> #define N 1001 using namespace std; int T,n,m,ans,f[N*4][N*4]; char c[2];int x1,x2,y1,y2; void changey(int kx,int ky,int ly,int ry) { if(y1<=ly&&ry<=y2) { f[kx][ky]++; return; } int mid=ly+ry>>1; if(y1<=mid) changey(kx,ky<<1,ly,mid); if(y2>mid) changey(kx,(ky<<1)+1,mid+1,ry); } void changex(int kx,int lx,int rx) { if(x1<=lx&&rx<=x2) { changey(kx,1,1,n); return; } int mid=lx+rx>>1; if(x1<=mid) changex(kx<<1,lx,mid); if(x2>mid) changex((kx<<1)+1,mid+1,rx); } void queryy(int kx,int ky,int ly,int ry) { ans+=f[kx][ky]; if(ly==ry) return; int mid=ly+ry>>1; if(y1<=mid) queryy(kx,ky<<1,ly,mid); else queryy(kx,(ky<<1)+1,mid+1,ry); } void queryx(int kx,int lx,int rx) { queryy(kx,1,1,n); if(lx==rx) return; int mid=lx+rx>>1; if(x1<=mid) queryx(kx<<1,lx,mid); else queryx((kx<<1)+1,mid+1,rx); } int main() { scanf("%d",&T); while(T--) { memset(f,0,sizeof(f)); scanf("%d%d",&n,&m); for(int i=1;i<=m;i++) { scanf("%s",c); if(c[0]=='C') { scanf("%d%d%d%d",&x1,&y1,&x2,&y2); changex(1,1,n); } else { scanf("%d%d",&x1,&y1); ans=0; queryx(1,1,n); printf("%d\n",ans%2); } } printf("\n"); } }