代码

#include<bits/stdc++.h>
#define re register
#define ui unsigned long long
using namespace std;
const int Mxdt=1000000;
inline char gc(){
	static char buf[Mxdt],*p1=buf,*p2=buf;
	return p1==p2&&(p2=(p1=buf)+fread(buf,1,Mxdt,stdin),p1==p2)?EOF:*p1++;
}
inline char pc(char ch,bool bj){
	static char buf[Mxdt],*p1=buf,*p2=buf+Mxdt;
	return (bj||(*p1++=ch)&&p1==p2)&&fwrite(p1=buf,1,p1-buf,stdout),0;
}
inline int read(){
	re int t=0,f=0;re char v=gc();
	while(v<'0')f|=(v=='-'),v=gc();
	while(v>='0')t=(t<<3)+(t<<1)+v-48,v=gc();
	return f?-t:t;
}
ui A[2][1100002];
int Z,n,m;
set<int>S;
set<int>::iterator it;
inline void add(re int x,re ui y){
	if(A[Z][x]+y<A[Z][x])add(x+1,1);
	A[Z][x]+=y;
	if(A[Z][x]^A[Z^1][x])S.insert(x);
	else if(S.find(x)!=S.end())S.erase(x);
}
int main(){
	n=read(),read(),read(),read();
	while(n--){
		re int o=read(),X=read();
		if(o==1){
			if(X>0)Z=0;
			else X=-X,Z=1;
			re ui x=X,y=read();
			re int p1=y>>6,p2=y&63;
			add(p1,x<<p2);if(p2)add(p1+1,x>>(64-p2));
		}
		else{
			re int ans,p1=X>>6,p2=X&63,ia=0;
			re ui v1=A[0][p1],v2=A[1][p1];
			ans=(v1>>p2&1)^(v2>>p2&1);
			if(p2){
				v1&=(1ull<<p2)-1,v2&=(1ull<<p2)-1;
				if(v1>v2)ia=1;
				else if(v1<v2)ia=1,ans^=1;
			}
			if(!ia){
				it=S.lower_bound(p1);
				if(it!=S.begin()){
					--it;
					if(A[0][*it]<A[1][*it])ans^=1;
				}
			}
			pc(ans+'0',0),pc('\n',0);
		}
	}
	pc('o',1);
}

评测结果