P6136 【模板】普通平衡树（数据加强版） FHQ 平衡树模板

大概确定了一下  以后就写fhq吧  splay也就lct里面用用   主要是fhq好写啊 而且也能可持久化 能旋转 啥都能干 

写个板子 de了我半天

 

#include<bits/stdc++.h>
using namespace std;
const int N = 1e6+1e5+10;
#define R register int
#define I inline void
#define lc(x) c[x][0]
#define rc(x) c[x][1]
int root,x,y,z;
int c[N][2],siz[N],val[N],pri[N],st[N],top,tot;
inline int in(){
	R x=0;char c=0;
	while(c<'0'||c>'9') c=getchar();
	while(c>='0'&&c<='9') x=(x<<1)+(x<<3)+(c^48),c=getchar();
	return x;
}
inline int new_node(R v){
	int now = top?st[top--]:++tot;
	siz[now]=1;val[now]=v;pri[now]=rand();
	return now;
}
I del_node(R v){
	siz[v]=val[v]=pri[v]=lc(v)=rc(v)=0;
	st[++top]=v;
}
I pushup(R x){
	siz[x]=siz[lc(x)]+siz[rc(x)]+1;
}
void split(R now,R k,R &x,R &y){
	if(!now) x=y=0;
	else{
		if(val[now]<=k) x=now,split(rc(now),k,rc(now),y);
		else y=now,split(lc(now),k,x,lc(now));
		pushup(now);
	}
}
int merge(R x,R y){
	if(!x||!y) return x+y;
	if(pri[x]<pri[y]){
		rc(x)=merge(rc(x),y);
		pushup(x);return x;
	}else{
		lc(y)=merge(x,lc(y));
		pushup(y);return y;
	} 
}
I insert(R a){
	split(root,a,x,y);
	root=merge(merge(x,new_node(a)),y);
}
I del(R a){
	split(root,a,x,z);
	split(x,a-1,x,y);
	R now = y;
	y=merge(lc(y),rc(y));
	del_node(now);
	root=merge(merge(x,y),z);
}
inline int rnk(R a){
	split(root,a-1,x,y);
	R now = siz[x]+1;
	root = merge(x,y);
	return now;
} 
inline int kth(R rt,R k){
	R now = rt;
	while(now){
		if(k<=siz[lc(now)]) now=lc(now);
		else if(k==siz[lc(now)]+1) return now;
		else k-=siz[lc(now)]+1,now=rc(now);
	}
}
inline int get_pre(R a){
	split(root,a-1,x,y);
	R now = kth(x,siz[x]);
	root = merge(x,y);
	return val[now];
}
inline int get_sub(R a){
	split(root,a,x,y);
	R now = kth(y,1);
	root = merge(x,y);
	return val[now];
}
void debug(int rt){
	if(lc(rt)) debug(lc(rt));
	printf("rt=%d siz[rt]=%d val[rt]=%d lc=%d rc=%d pri=%d\n",rt,siz[rt],val[rt],lc(rt),rc(rt),pri[rt]);
	if(rc(rt)) debug(rc(rt));
}
int main(){
	srand(time(0));
	R n,m,v,op;
	n=in(),m=in();
	for(R i = 1; i <= n; i++){
		v=in();
		insert(v);
	}
	int las=0,sum=0;
	for(R i = 1; i <= m; i++){
		op=in(),v=in();
		v^=las;
		if(op==1) insert(v);
		else if(op==2) del(v);
		else if(op==3) sum^=(las=rnk(v));
		else if(op==4) sum^=(las=val[kth(root,v)]);
		else if(op==5) sum^=(las=get_pre(v));
		else  sum^=(las=get_sub(v));
	}
	printf("%d\n",sum);
	return 0;
}