Kiritow
/
OJ-Problems-Source
mirror of https://github.com/Kiritow/OJ-Problems-Source
1
0
Fork 0
Code Issues Projects Releases Wiki Activity

Create 1838_x7536110.cpp

pull/45/head
Kirigaya Kazuto 2016-10-12 11:32:13 +08:00 committed by GitHub
parent 5e9b3594c9
commit 1c4eac721f
1 changed files with 62 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

62
QUSTOJ/1838_x7536110.cpp Normal file
View File

@ -0,0 +1,62 @@
#include <iostream>
#include <cstring>
#include <cstdio>
using namespace std;
long long tree[2][2][3100][3100];
int n,m;
int add(int x,int y,long long v){
for (int i=x;i<=n;i+=i&(-i))
for (int j=y;j<=n;j+=j&(-j))
tree[x&1][y&1][i][j]^=v;
return 0;
}
long long sum(int x,int y){
long long ans=0;
for (int i=x;i>0;i-=i&(-i))
for (int j=y;j>0;j-=j&(-j))
ans^=tree[x&1][y&1][i][j];
return ans;
}
int main(){
// freopen("in","r",stdin);
// freopen("out","w",stdout);
while (~scanf("%d%d",&n,&m)){
memset(tree,0,sizeof tree);
for (int i=1;i<=m;i++){
char op[2];scanf("%s",op);
int x1,y1,x2,y2;scanf("%d%d%d%d",&x1,&y1,&x2,&y2);
if (op[0]=='P'){
int manyNum;scanf("%d",&manyNum);
long long val;val=0;
for (int j=0;j<manyNum;j++){
int a,b;
scanf("%d%d",&a,&b);
if (b%2){
long long kkk=((long long)1)<<(a-1);
val=val^kkk;
}
}
add(x2+1,y2+1,val);
add(x1,y2+1,val);
add(x2+1,y1,val);
add(x1,y1,val);
}
else {
long long ans=0;
ans^=sum(x2,y2);
if (x1>1) ans^=sum(x1-1,y2);
if (y1>1) ans^=sum(x2,y1-1);
if (x1>1&&y1>1) ans^=sum(x1-1,y1-1);
for (int j=0;j<50;j++){
long long kkk=((long long)1)<<j;
if ((ans&kkk)!=0) printf("2 ");
else printf("1 ");
}
printf("\n");
}
}
}
return 0;
}