代码

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#include<bitset>
#include<set>
using namespace std;
typedef long long ll;
const int MAXSIZE=30000020;
int bufpos;
char buf[MAXSIZE];
#define NEG 1
void init(){
	#ifdef LOCAL
		freopen("E.txt","r",stdin);
	#endif
	buf[fread(buf,1,MAXSIZE,stdin)]='\0';
	bufpos=0;
}
#if NEG
int readint(){
	bool isneg;
	int val=0;
	for(;!isdigit(buf[bufpos]) && buf[bufpos]!='-';bufpos++);
	bufpos+=(isneg=buf[bufpos]=='-');
	for(;isdigit(buf[bufpos]);bufpos++)
		val=val*10+buf[bufpos]-'0';
	return isneg?-val:val;
}
#else
int readint(){
	int val=0;
	for(;!isdigit(buf[bufpos]);bufpos++);
	for(;isdigit(buf[bufpos]);bufpos++)
		val=val*10+buf[bufpos]-'0';
	return val;
}
#endif
char readchar(){
	for(;isspace(buf[bufpos]);bufpos++);
	return buf[bufpos++];
}
int readstr(char* s){
	int cur=0;
	for(;isspace(buf[bufpos]);bufpos++);
	for(;!isspace(buf[bufpos]);bufpos++)
		s[cur++]=buf[bufpos];
	s[cur]='\0';
	return cur;
}
const int maxn=40000100;
typedef set<int,greater<int> > st;
st s;
bitset<maxn> x,y;
void add(int a,int b){
	st::iterator it=s.begin();
	bool flag=0,carry=0;
	if (!a)
		return;
	if (a<0)
		a=-a,flag=1;
	for(int i=b;carry||a;i++,a/=2){
		int qwq=a&1;
		if (carry^qwq){
			if (x[i]^y[i])
				s.erase(i);
			else it=s.insert(it,i);
			if (flag)
				carry=y[i],y.flip(i);
			else carry=x[i],x.flip(i);
		}
	}
}
int main(){
	init();
	int n=readint();
	readint(),readint(),readint();
	while(n--){
		int op=readint();
		if (op==1){
			int a=readint(),b=readint();
			add(a,b);
		}else{
			int a=readint();
			st::iterator res=s.lower_bound(a-1);
			if (res==s.end())
				printf("%d\n",x[a]^y[a]);
			else printf("%d\n",x[a]^y[a]^y[*res]);
		}
	}

}

评测结果