poj2155

二维树状数组。记录一个矩阵中的某个位置被提到几次，有篇文章说的很好。imos
至于怎么高效改变一个区间的值，高效询问某个位置的值，那么用树状数组是最快的。

#include<stdio.h>
#include<iostream>
#include<string>
#include<string.h>
#include<algorithm>
#include<iomanip>
#include<vector>
#include<time.h>
#include<queue>
#include<stack>
#include<iterator>
#include<math.h>
#include<stdlib.h>
#include<limits.h>
#include<map>
#include<set>
#include<bitset>
//#define ONLINE_JUDGE
#define eps 1e-8
#define INF 0x7fffffff
#define FOR(i,a) for((i)=0;i<(a);(i)++)
#define MEM(a) (memset((a),0,sizeof(a)))
#define sfs(a) scanf("%s",a)
#define sf(a) scanf("%d",&a)
#define sfI(a) scanf("%I64d",&a)
#define pf(a) printf("%d\n",a)
#define pfI(a) printf("%I64d\n",a)
#define pfs(a) printf("%s\n",a)
#define sfd(a,b) scanf("%d%d",&a,&b)
#define sft(a,b,num) scanf("%d%d%d",&a,&b,&num)
#define for1(i,a,b) for(int i=(a);i<b;i++)
#define for2(i,a,b) for(int i=(a);i<=b;i++)
#define for3(i,a,b)for(int i=(b);i>=a;i--)
#define MEM1(a) memset(a,0,sizeof(a))
#define MEM2(a) memset(a,-1,sizeof(a))
#define ll long long
const double PI = acos(-1.0);
template<class T> T gcd(T a, T b) {
    return b ? gcd(b, a % b) : a;
}
template<class T> T lcm(T a, T b) {
    return a / gcd(a, b) * b;
}
template<class T> inline T Min(T a, T b) {
    return a < b ? a : b;
}
template<class T> inline T Max(T a, T b) {
    return a > b ? a : b;
}
using namespace std;
#define M 1010
int n, m;
int lowbit(int x) {
    return x & (-x);
}
int a[M][M];
void upDate(int x, int y, int val) {
    for (int i = x; i <= n; i += lowbit(i)) {
        for (int j = y; j <= n; j += lowbit(j)) {
            a[i][j] += val;
        }
    }
}
int getSum(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 += a[i][j];
        }
    }
    return sum;
}
int main() {
#ifndef ONLINE_JUDGE
    freopen("in.txt", "r", stdin);
    //    freopen("out.txt", "w", stdout);
#endif
    int t;
    sf(t);
    while (t--) {
        sfd(n, m);
        memset(a, 0, sizeof a);
        char od[5];
        int x1, y1, x2, y2;
        for (int i = 0; i < m; i++) {
            scanf("%s", od);
            if (od[0] == 'C') {
                scanf("%d%d%d%d", &x1, &y1, &x2, &y2);
                upDate(x1, y1, 1);
                upDate(x2 + 1, y1, -1);
                upDate(x1, y2 + 1, -1);
                upDate(x2 + 1, y2 + 1, 1);
            } else {
                scanf("%d%d", &x1, &y1);
                int val = getSum(x1, y1);
                printf("%d\n", val & 1);
            }
        }
        if (t)
            printf("\n");
    }
    return 0;
}