poj2155
添加 x,y,由于多添加了,所以减去x1+1,y,和x,y1+1,但多减去了x1,y1之后,要加上,x1,y1。
#include<stdio.h>
#include<string.h>
#include<string>
#include<math.h>
#include<algorithm>
#include<iostream>
#include<queue>
#include<vector>
#include<stack>
#include<map>
#include<set>
#include<stdlib.h>
#include<time.h>
#include <iomanip>
#define lowbit(x) (x&(-x))
#define inf 0x7fffffff
#define linf 0x7fffffffffffffff
#define fill(x,y) memset(x,y,sizeof(x))
#define fup(i,x,y) for(int i=(x);i<=(y);i++)
#define fdn(i,x,y) for(int i=(x);i>=(y);i--)
#define sp(x) setprecision(x)
#define sd(n) scanf("%d",&n)
#define sdd(n,m) scanf("%d%d",&n,&m)
#define sddd(n,m,k) scanf("%d%d%d",&n,&m,&k)
#define sld(n) scanf("%lld",&n)
#define sldd(n,m) scanf("%lld%lld",&n,&m)
#define slddd(n,m,k) scanf("%lld%lld%lld",&n,&m,&k)
#define sf(n) scanf("%lf",&n)
#define sff(n,m) scanf("%lf%lf",&n,&m)
#define sfff(n,m,k) scanf("%lf%lf%lf",&n,&m,&k)
#define sc(n) scanf("%s",&n)
#define pf(x) printf("%d\n",x)
#define pfl(x) printf("%lld\n",x)
#define pff(x) printf("%lf\n",x)
#define N 10000
#define M 4000009
#define mod 9973
#define pi acos(-1)
#define eps 1e-2
//cout.setf(ios::fixed);
//freopen("out.txt","w",stdout);
using namespace std;
typedef long long ll;
typedef double db;
int tree[1040][1040],n;
void add(int i,int jj,int val)
{
while(i<=n)
{
int j=jj;
while(j<=n)
{
tree[i][j]+=val;
j+=lowbit(j);
}
i+=lowbit(i);
}
}
int cal(int i,int jj)
{
int res=0;
while(i>=1)
{
int j=jj;
while(j>=1)
{
res+=tree[i][j];
j-=lowbit(j);
}
i-=lowbit(i);
}
return res;
}
int main()
{
int ans=0,x,y,t,q;
char c;
cin>>t;
while(t--)
{
cin>>n>>q;
memset(tree,0,sizeof(tree));
while(q--)
{
cin>>c;
if(c=='C')
{
int x1,y1;
cin>>x>>y>>x1>>y1;
add(x,y,1);
add(x,y1+1,-1);
add(x1+1,y,-1);
add(x1+1,y1+1,1);
}
else
{
cin>>x>>y;
cout<<cal(x,y)%2<<endl;
}
}
if(t)printf("\n");
}
return 0;
}