二维树状数组hdu2642

#include<iostream>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<cstdio>
#include<string>
#include<set>
#include<map>
#include<queue>
#include<vector>
#include<stack>
#include<cstdlib>
using namespace std;
#define ll long long
#define cl(a,b) memset(a,b,sizeof(a))
#define N 50005
#define MAXN 100005
int c[1005][1005];
int b[1005][1005];
inline int lowbit(int x)
{
    return x&(-x);
}
void add(int x,int y,int val)
{
    for(int i=x;i<1005;i+=lowbit(i)){
        for(int j=y;j<1005;j+=lowbit(j)){
            c[i][j]+=val;
        }
    }
}
int sum(int x,int y)
{
    int ans=0;
    for (int i=x;i>0;i-=lowbit(i)){
        for (int j=y;j>0;j-=lowbit(j)){
            ans+=c[i][j];
        }
    }
    return ans;
}
int main()
{
    int t,x,y;
    char a;
    scanf("%d",&t);
    cl(c,0);
    cl(b,0);
    while(t--)
    {
        getchar();
        scanf("%c",&a);

        if(a=='B')
        {
            scanf("%d%d",&x,&y);
            x++;
            y++;
            if(b[x][y])continue;
            b[x][y]=1;
            add(x,y,1);
        }
        else if(a=='D')
        {
            scanf("%d%d",&x,&y);
            x++;
            y++;
            if(!b[x][y])continue;
            b[x][y]=0;
            add(x,y,-1);
        }
        else if(a=='Q')
        {
            int x1,x2,y1,y2;
            scanf("%d%d%d%d",&x1,&x2,&y1,&y2);
            int s=0;
            if(x1>x2)swap(x1,x2);
            if(y1>y2)swap(y1,y2);
            s=sum(x2+1,y2+1)+sum(x1,y1)-sum(x1,y2+1)-sum(x2+1,y1);
            printf("%d\n",s);
        }
    }
    return 0;
}