BZOJ3685 普通van Emde Boas树

题目：

设计数据结构支持:
1 x  若x不存在,插入x
2 x  若x存在,删除x
3    输出当前最小值,若不存在输出-1
4    输出当前最大值,若不存在输出-1
5 x  输出x的前驱,若不存在输出-1
6 x  输出x的后继,若不存在输出-1
7 x  若x存在,输出1,否则输出-1

其中数的范围<=10^6,操作数<=2*10^6。

看着算导写了个veb模板，最后超时在建树上，附上veb代码仅供纪念：

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<vector>
using namespace std;
int cnt=0;
inline int read()
{
    int x=0,f=1;char ch=getchar();
    while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
    while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
    return x*f;
}
struct node
{
	int u,minn,maxn,summary;
	vector<int>cluster;
	int high(int x)
	{
		int c=(1<<(int(log2(u)/2)));
		return x/c;
	}
	int low(int x)
	{   
	    int c=(1<<(int(log2(u)/2)));
		return x%c;
	}
	int index(int x,int y)
	{
		int c=(1<<(int(log2(u)/2)));
		return x*c+y;
	}
}tree[7232900];
int Minimum(int x)
{
	return tree[x].minn;
}
int Maximum(int x)
{
	return tree[x].maxn;
}
bool Member(int v,int x)
{   
	if(x==tree[v].minn||x==tree[v].maxn)return 1;
	else if(tree[v].u==2)return 0;
	else return Member(tree[v].cluster[tree[v].high(x)],tree[v].low(x));
}
void Insert_empty(int v,int x)
{
	tree[v].minn=x;
	tree[v].maxn=x;
}
void Insert(int v,int x)
{
	if(tree[v].minn==-1)Insert_empty(v,x);
	else 
	{
	     if(x<tree[v].minn)swap(tree[v].minn,x);
	     if(tree[v].u>2)
	     {
	     	if(Minimum(tree[v].cluster[tree[v].high(x)])==-1)
	     	{
	     		Insert(tree[v].summary,tree[v].high(x));
	     		Insert_empty(tree[v].cluster[tree[v].high(x)],tree[v].low(x));
	     	}
	     	else Insert(tree[v].cluster[tree[v].high(x)],tree[v].low(x));
	     }
	     if(x>tree[v].maxn)tree[v].maxn=x;
    }
}
int Successor(int v,int x)
{
	if(tree[v].u==2)
	{
		if(x==0&&tree[v].maxn==1)return 1;
		else return -1;
	}
	else if(tree[v].minn!=-1&&x<tree[v].minn)return tree[v].minn;
	else
	{
		int max_low=Maximum(tree[v].cluster[tree[v].high(x)]);
		if(max_low!=-1&&tree[v].low(x)<max_low)
		{
			int off_set=Successor(tree[v].cluster[tree[v].high(x)],tree[v].low(x));
			return tree[v].index(tree[v].high(x),off_set);
		}
		else
		{
			int succ_cluster=Successor(tree[v].summary,tree[v].high(x));
			if(succ_cluster==-1)return -1;
			else 
			{
				int off_set=Minimum(tree[v].cluster[succ_cluster]);
				return tree[v].index(succ_cluster,off_set);
			}
		}
	}
}
int Predecessor(int v,int x)
{
	if(tree[v].u==2)
	{
		if(x==1&&tree[v].minn==0)return 0;
		else return -1;
	}
	else if(tree[v].maxn!=-1&&x>tree[v].maxn)return tree[v].maxn;
	else
	{
		int min_low=Minimum(tree[v].cluster[tree[v].high(x)]);
		if(min_low!=-1&&tree[v].low(x)>min_low)
		{
			int offset=Predecessor(tree[v].cluster[tree[v].high(x)],tree[v].low(x));
			return tree[v].index(tree[v].high(x),offset);
		}
		else
		{
			int pred_cluster=Predecessor(tree[v].summary,tree[v].high(x));
			if(pred_cluster==-1)
			{
				if(tree[v].minn!=-1&&x>tree[v].minn)return tree[v].minn;
				else return -1;
			}
			else
			{
				int offset=Maximum(tree[v].cluster[pred_cluster]);
				return tree[v].index(pred_cluster,offset);
			}
		}
	}
}
void Delete(int v,int x)
{
	if(tree[v].minn==tree[v].maxn)
	{
		tree[v].minn=-1;
		tree[v].maxn=-1;
	}
	else if(tree[v].u==2)
	{
		if(x==0)tree[v].minn=1;
		else tree[v].minn=0;
		tree[v].maxn=tree[v].minn;
	}
	else 
	{   
	    if(x==tree[v].minn)
	    {
		   int first_cluster=Minimum(tree[v].summary);
		   x=tree[v].index(first_cluster,Minimum(tree[v].cluster[first_cluster]));
		   tree[v].minn=x;
	    }
		Delete(tree[v].cluster[tree[v].high(x)],tree[v].low(x));
		if(Minimum(tree[v].cluster[tree[v].high(x)])==-1)
		{
			Delete(tree[v].summary,tree[v].high(x));
			if(x==tree[v].maxn)
			{
				int summary_maxn=Maximum(tree[v].summary);
				if(summary_maxn==-1)tree[v].maxn=tree[v].minn;
				else tree[v].maxn=tree[v].index(summary_maxn,Maximum(tree[v].cluster[summary_maxn]));
			}
		}
		else if(x==tree[v].maxn)tree[v].maxn=tree[v].index(tree[v].high(x),Maximum(tree[v].cluster[tree[v].high(x)]));
	}
}
void Build(int &x,int u)
{   
    x=++cnt;
	if(u==2)
	{
		tree[x].maxn=tree[x].minn=-1;
		tree[x].u=u;
		return;
	}
	else
	{   
	    int c=log2(u);
	    if(c%2==0)c/=2;
	    else c=c/2+1;
	    int uu=(1<<c);
	    tree[x].u=u;
	    tree[x].maxn=tree[x].minn=-1;
		Build(tree[x].summary,uu);
		for(int i=0;i<uu;i++)tree[x].cluster.push_back(-1);
		for(int i=0;i<uu;i++)Build(tree[x].cluster[i],uu);
	}
}
int main(){
    int n,m;
    n=read(); m=read();
    int bj,v,root;
    int sum=0;
    Build(root,(1<<20));
    for(int i=1;i<=m;i++)
    {
    	bj=read();
    	if(bj==1)
    	{   
    	    v=read();
    		if(!Member(root,v))Insert(root,v);
    	}
    	if(bj==2)
    	{
    		v=read();
    		if(Member(root,v))Delete(root,v);
    	}
    	if(bj==3)cout<<tree[root].minn<<'\n';
    	if(bj==4)cout<<tree[root].maxn<<'\n';
    	if(bj==5)
    	{
    		v=read();
    		cout<<Predecessor(root,v)<<'\n';
    	}
    	if(bj==6)
    	{
    		v=read();
    		cout<<Successor(root,v)<<'\n';
    	}
    	if(bj==7)
    	{
    		v=read();
    		bool is=Member(root,v);
    		if(is)cout<<"1\n";
    		else cout<<"-1\n";
    	}
    }
	return 0;
}