标签：
Description
Input
Output
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
1 #include <iostream> 2 #include <cstdio> 3 #include <algorithm> 4 #include <cstring> 5 #include <vector> 6 #include <utility> 7 #include <iomanip> 8 #include <string> 9 #include <cmath> 10 #include <map> 11 12 const int MAXN = 1000 + 10; 13 const int MAX = 32000 + 10; 14 using namespace std; 15 int n, m;//m为操作次数 16 int C[MAXN][MAXN]; 17 18 int lowbit(int x){return x&-x;} 19 /*int sum(int x, int y){ 20 int cnt = 0, tmp; 21 while (x > 0){ 22 tmp = y; 23 while (tmp > 0){ 24 cnt += C[x][tmp]; 25 tmp -= lowbit(tmp); 26 } 27 x -= lowbit(x); 28 } 29 return cnt; 30 } 31 void add(int x, int y, int val){ 32 int tmp; 33 while (x <= 1000){ 34 tmp = y; 35 while (tmp <= 1000){ 36 C[x][tmp] += val; 37 tmp += lowbit(tmp); 38 } 39 x += lowbit(x); 40 } 41 return; 42 }*/ 43 void add(int x,int y) { 44 int i,k; 45 for(i=x; i<=n; i+=lowbit(i)) 46 for(k=y; k<=n; k+=lowbit(k)) 47 C[i][k]++; 48 } 49 int sum(int x,int y) { 50 int i,k,cnt = 0; 51 for(i=x; i>0; i-=lowbit(i)) 52 for(k=y; k>0; k-=lowbit(k)) 53 cnt += C[i][k]; 54 return cnt; 55 } 56 57 void work(){ 58 scanf("%d%d", &n, &m); 59 for (int i = 1; i <= m; i++){ 60 char str[2]; 61 scanf("%s", str); 62 if (str[0] == ‘Q‘){ 63 int x, y; 64 scanf("%d%d", &x, &y); 65 //x++;y++; 66 printf("%d\n", sum(x, y)%2); 67 }else if (str[0] == ‘C‘){ 68 int x1, y1, x2, y2; 69 scanf("%d%d%d%d", &x1, &y1, &x2, &y2); 70 x1++;y1++;x2++;y2++; 71 add(x2, y2); 72 add(x2, y1 - 1); 73 add(x1 - 1, y2); 74 add(x1 - 1, y1 - 1); 75 } 76 } 77 } 78 79 int main(){ 80 int T; 81 #ifdef LOCAL 82 freopen("data.txt", "r", stdin); 83 freopen("out.txt", "w", stdout); 84 #endif 85 scanf("%d", &T); 86 while (T--){ 87 memset(C, 0, sizeof(C)); 88 work(); 89 printf("\n"); 90 } 91 return 0; 92 }
标签：
原文地址：http://www.cnblogs.com/hoskey/p/4320030.html
