hdu 2462

OJ

#include <iostream>#include <cstdio>#include <cstdlib>#include <algorithm>#include <vector>#include <map>#include <set>#include <string>#include <cstring>#include <list>#include <queue>#include <stack>#include <cmath>using namespace std;#define PF(x) (scanf("%d",&x))#define PT(x,y) (scanf("%d%d",&x,&y))#define PR(x) (printf("%d\n",x))#define PRT(x,y)(printf("%d %d\n",x,y))#define M 1005int arr[M][M];int maxx(int x,int y){return x>y?x:y;}int minx(int x,int y){return x>y?y:x;}int low(int x){return x&(-x);}void add(int x,int y,int c){int t=y;for(x;x<M;x+=low(x))for(t = y;t<M;t+=low(t))arr[x][t]+=c;}int sums(int x,int y){int sumt = 0;int t;for(;x;x-=low(x))for(t=y;t;t-=low(t))sumt += arr[x][t];return sumt;}int getsum(int x,int y,int xx,int yy){return sums(xx,yy)+sums(x-1,y-1)-sums(x-1,yy)-sums(xx,y-1);}void init(){int q;while(scanf("%d",&q)!=EOF){memset(arr,0,sizeof(arr));char ch[10];int x,y,xx,yy;for(int i=0;i<q;i++){scanf("%s",ch);if(ch[0]=='B'){PT(x,y);x++,y++;int a = getsum(x,y,x,y);if(a==0) add(x,y,1);}else if(ch[0] == 'D'){PT(x,y);x++,y++;int a = getsum(x,y,x,y);if(a==1) add(x,y,-1);}else{PT(x,xx);PT(y,yy);x++,xx++,y++,yy++;int ix = minx(x,xx);int iy  =minx(y,yy);int ax = maxx(x,xx);int ay = maxx(y,yy);PR(getsum(ix,iy,ax,ay));}}}return ;}int main(){init();return 0;}