POJ 2155 (二维树状数组) #by nobody

题目链接：http://poj.org/problem?id=2155

code：

#include <iostream>
#include <cstdio>
using namespace std;
#define lowbit(x) (x&-x)
#define MAXN 1010
int n;
int c[MAXN][MAXN];
void update(int x,int y)
{
    for(int i=x;i<=n;i += lowbit(i))
        for(int j=y;j<=n;j += lowbit(j))
            c[i][j]++ ;
}


int get(int x,int y)
{
    int ret = 0;
    for(int i=x;i>0;i-=lowbit(i))
        for(int j=y;j>0;j-=lowbit(j))
            ret += c[i][j];
    return ret;
}
int main()
{
    //freopen("input.txt","r",stdin);
    int cases;
    scanf("%d",&cases);
    while(cases--)
    {
        int m;
        scanf("%d%d",&n,&m);
        memset(c,0,sizeof(c));
        for(int i=0;i<m;i++)
        {
            int ch[2];
            scanf("%s",ch);
            if(ch[0] == 'C')
            {
                int x1,x2,y1,y2;
                scanf("%d%d%d%d",&x1,&y1,&x2,&y2);
                update(x1,y1);update(x1,y2+1);
                update(x2+1,y1);update(x2+1,y2+1);
            }
            else
            {
                int x,y;
                scanf("%d%d",&x,&y);
                printf("%d\n",get(x,y)%2);
            }
        }
        printf("\n");
    }
    return 0;
}