BZOJ4546 codechef XRQRS

转2进制后建trie树和以2的幂为上限建权值线段树本质上是等价的，所以用可持久化trie或者主席树就都可以直接过了

内存卡的特别紧，wa也有可能是内存开小了造成的，MAXN开5.2*10^5，开5*10^5我就wa了

#include<cstdlib>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<ctime>
#include<algorithm>
#include<iomanip>
#include<vector>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<bitset>
using namespace std;
#define MAXN 520010
#define MAXM MAXN*20
#define ll long long
#define INF 1000000000
#define MOD 1000000007
#define eps 1e-8
int rt[MAXN];
int siz[MAXM],son[MAXM][2];
int tot;
int m;
int n;
void change(int &x,int xx,int d,int p){
	x=++tot;
	memcpy(son[x],son[xx],sizeof(son[x]));
	siz[x]=siz[xx]+1;
	if(d<0){
		return ;
	}
	if((p>>(d-1))&1){
		change(son[x][1],son[xx][1],d-1,p);
	}else{
		change(son[x][0],son[xx][0],d-1,p);
	}
}
int ask1(int x,int xx,int d,int y){
	if(d<0){
		return 0;
	}
	bool z=(y>>(d-1))&1^1;
	if(siz[son[xx][z]]-siz[son[x][z]]){
		return (1<<(d-1))+ask1(son[x][z],son[xx][z],d-1,y);
	}else{
		return ask1(son[x][z^1],son[xx][z^1],d-1,y);
	}
}
int ask2(int x,int xx,int d,int now,int y){
	if(d<0){
		return 0;
	}
	if(y>=now+(1<<(d-1))){
		return siz[son[xx][0]]-siz[son[x][0]]+ask2(son[x][1],son[xx][1],d-1,now+(1<<(d-1)),y);
	}else{
		return ask2(son[x][0],son[xx][0],d-1,now,y);
	}
}
int ask3(int x,int xx,int d,int k){
	if(d<0){
		return 0;
	}
	int t=siz[son[xx][0]]-siz[son[x][0]];
	if(k<=t){
		return ask3(son[x][0],son[xx][0],d-1,k);
	}else{
		return (1<<(d-1))+ask3(son[x][1],son[xx][1],d-1,k-t);
	}
}
int main(){
	int o,x,y,z;
	scanf("%d",&m);
	while(m--){
		scanf("%d",&o);
		if(o==1){
			scanf("%d",&x);
			change(rt[++n],rt[n],19,x);
		}
		if(o==2){
			scanf("%d%d%d",&x,&y,&z);
			printf("%d\n",z^ask1(rt[x-1],rt[y],19,z));
		}
		if(o==3){
			scanf("%d",&x);
			n-=x;
			tot=rt[n+1]-1;
		}
		if(o==4){
			scanf("%d%d%d",&x,&y,&z);
			printf("%d\n",ask2(rt[x-1],rt[y],19,0,z));
		}
		if(o==5){
			scanf("%d%d%d",&x,&y,&z);
			printf("%d\n",ask3(rt[x-1],rt[y],19,z));
		}
	}
	return 0;
}

/*
10
1 8
5 1 1 1
1 2
2 2 2 7
2 2 2 7
1 1
4 2 2 2
2 1 2 3
4 1 3 5
1 6

*/