HDU 2642 Stars

二维树状数组，593ms，慢得一塌糊涂。。

#include<iostream>
#include<string>
#include<cstring>
#include<cmath>
#include<cstdio>
#include<vector>
#include<queue>
#include<map>

using namespace std;

const int maxn = 1010;
bool vis[maxn][maxn];
int cnt[maxn][maxn];

void swap(int& a,int& b){ if(a>b) {int tmp=a;a=b;b=tmp;} }

inline int numLowBit(int x){return x&(-x);}

void update(int x,int y,int d){
    for(int i=x;i<maxn;i+=numLowBit(i))
        for(int j=y;j<maxn;j+=numLowBit(j))
            cnt[i][j]+=d;
}

int sum(int x,int y){
    if(x==0||y==0) return 0;
    int ret=0;
    for(int i=x;i>0;i-=numLowBit(i))
        for(int j=y;j>0;j-=numLowBit(j))
            ret+=cnt[i][j];
    return ret;
}

int main()
{
#ifndef ONLINE_JUDGE
    freopen("a.in", "r", stdin);
#endif
    int n;
    while(cin>>n){
        char c;
        memset(vis,false,sizeof(vis));
        memset(cnt,0,sizeof(cnt));
        int x1,x2,y1,y2;
        for(int i=0;i<n;i++){
            cin>>c;
            if(c=='B'||c=='D'){
                cin>>x1>>y1;
                x1++;y1++;
                if(c=='D'&&vis[x1][y1]){
                    update(x1,y1,-1);
                    vis[x1][y1]=false;
                }
                else if(c=='B'&&!vis[x1][y1]){
                    update(x1,y1,1);
                    vis[x1][y1]=true;
                }
            }
            else{
                cin>>x1>>x2>>y1>>y2;
                x1++;x2++;y2++;y1++;
                swap(x1,x2);swap(y1,y2);
                cout<<sum(x2,y2)-sum(x1-1,y2)-sum(x2,y1-1)+sum(x1-1,y1-1)<<endl;
            }
        }
    }
    return 0;
}