Matrix
Time Limit: 3000MS | Memory Limit: 65536K | |
Total Submissions: 15125 | Accepted: 5683 |
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
一个二维树状数组,好像题目说错了,其实是左下角和右上角的。
1 #include <iostream> 2 #include <algorithm> 3 #include <stdio.h> 4 #include <string.h> 5 #include <math.h> 6 using namespace std; 7 long long int a[1100][1100]; 8 int m; 9 int lowbit(int x) 10 { 11 return x&(-x); 12 } 13 void update(int x,int y,int x1,int y1) 14 { 15 int i,j; 16 for(i=x1;i>0;i-=lowbit(i)) 17 for(j=y1;j>0;j-=lowbit(j)) 18 a[i][j]++; 19 20 for(i=x-1;i>0;i-=lowbit(i)) 21 for(j=y-1;j>0;j-=lowbit(j)) 22 a[i][j]++; 23 24 for(i=x1;i>0;i-=lowbit(i)) 25 for(j=y-1;j>0;j-=lowbit(j)) 26 a[i][j]++; 27 28 for(i=x-1;i>0;i-=lowbit(i)) 29 for(j=y1;j>0;j-=lowbit(j)) 30 a[i][j]++; 31 } 32 int fun(int x,int y) 33 { 34 int i,j; 35 int sum=0; 36 for(i=x;i<=m;i+=lowbit(i)) 37 for(j=y;j<=m;j+=lowbit(j)) 38 sum+=a[i][j]; 39 return sum%2; 40 } 41 int main() 42 { 43 //freopen("int.txt","r",stdin); 44 int n; 45 int i,j; 46 scanf("%d",&n); 47 for(i=0;i<n;i++) 48 { 49 memset(a,0,sizeof(a)); 50 int k; 51 scanf("%d%d",&m,&k); 52 char b; 53 for(j=0;j<k;j++) 54 { 55 cin>>b; 56 int x1,x2,y1,y2; 57 if(b=='Q') 58 { 59 scanf("%d%d",&x1,&y1); 60 printf("%d\n",fun(x1,y1)); 61 } 62 else 63 { 64 scanf("%d%d%d%d",&x1,&y1,&x2,&y2); 65 update(x1,y1,x2,y2); 66 } 67 } 68 if(i!=n-1) 69 printf("\n"); 70 } 71 }