bzoj 3224 Tyvj 1728 普通平衡树

不知道为什么TLE了，%%yzy（yy2333）

留个坑吧，等着再改改233

/*#include<bits/stdc++.h>
#define N 100005
#define LL long long
#define inf 0x3f3f3f3f
#define ls tr[x][0]
#define rs tr[x][1]
using namespace std;
inline int ra()
{
    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;
}
int n,cnt;
struct SPLAY{
    int fa[N],tr[N][2],root,v[N],size[N],w[N];
    bool which(int x){return tr[fa[x]][1]==x;}
    void update(int x){size[x]=size[ls]+size[rs]+w[x];}
    void rotate(int x)
    {
        int y=fa[x],z=fa[y]; bool nx=which(x),ny=which(y); 
        tr[y][nx]=tr[x][!nx]; fa[tr[x][!nx]]=y;
        tr[x][!nx]=y; fa[y]=x; fa[x]=z;
        if (z) tr[z][ny]=x; update(y);
    }
    void splay(int x, int aim)
    {
        while (fa[x]!=aim)
        {
            int y=fa[x],z=fa[y];
            if (z==aim) rotate(x);
            else if (which(x)==which(y)) rotate(y),rotate(x);
            else rotate(x),rotate(x);
        }
        if (!aim) root=x; update(x);
    }
    void insert(int val)
    {
        int x=root;
        while (1)
        {
            if (val==v[x]) {w[x]++;return;}
            else if (val<v[x])   {
                if (!ls) {ls=++cnt,fa[cnt]=x,size[cnt]=1,splay(cnt,0),v[cnt]=val,w[cnt]=1; return;} else x=ls;}
            else {
                if (!rs) {rs=++cnt,fa[cnt]=x,size[cnt]=1,splay(cnt,0),v[cnt]=val,w[cnt]=1; return;} else x=rs;}
        }
    }
    int getpre(int val) 
    {
        int x=root,pos,ans=-inf;
        while (1)
        { 
            if ((ls==0 && rs==0) || x==0) break;
            if (v[x]>=val) x=ls;
            else pos=x,x=rs;
        }
        return pos;
    }
    int getlst(int val)
    {
        int x=root,ans=inf,pos;
        while (1)
        {
            if ((ls==0 && rs==0) || x==0) break;
            if (v[x]<=val) x=rs;
            else pos=x,x=ls;
        }
        return pos;
    }
    int getrank(int val)
    {
        int x=root,rk=0;
        while (1)
        {       
            if (val==v[x]) {rk+=size[ls]+1; break;}
            else if (val>v[x]) {rk+=size[ls]+w[x]; rs=x;}
            else x=ls; 
        }
        return rk;
    }
    void del(int val)
    {
        int x=getrank(val),y;
        while (ls || rs)
        {
            if (size[ls]>size[rs]) y=ls;
            else y=rs;
            rotate(y);
        }
        if (w[tr[fa[x]][which(x)]]==1) tr[fa[x]][which(x)]=0;
            else w[tr[fa[x]][which(x)]]--,size[tr[fa[x]][which(x)]]--;
        while (x=fa[x]) update(x);
    }
    int rank(int k)
    {
        int x=root; 
        while (1)
        {
            if (k>=size[ls]+1 && k<=size[ls]+w[x]) break;
            else if (k<=size[ls]) x=ls;
            else k-=(size[ls]+w[x]),x=rs;
        }
        return v[x];
    }
}T;
int main()
{
    n=ra();
    T.insert(-inf); T.insert(inf);
    for (int i=1; i<=n; i++)
    {
        int opt=ra(),x=ra();
        if (opt==1) T.insert(x);
        if (opt==2) T.del(x);
        if (opt==3) printf("%d
",T.getrank(x)-1);
        if (opt==4) printf("%d
",T.rank(x+1));
        if (opt==5) printf("%d
",T.v[T.getpre(x)]);
        if (opt==6) printf("%d
",T.v[T.getlst(x)]);
    }
    return 0;
}*/
#include<algorithm>
#include<iostream>
#include<cstdlib>
#include<cstring>
#include<cstdio>
#include<vector>
#include<queue>
#include<cmath>
#include<ctime>
#include<set>
#include<map>
using namespace std;
const int N=100005;
int fa[N],ch[N][2],size[N],v[N],mx[N];
int n,root,cnt;
void push_up(int x)
{
    size[x]=size[ch[x][0]]+size[ch[x][1]]+1;
    mx[x]=max(v[x],max(mx[ch[x][0]],mx[ch[x][1]]));
}
void rotate(int x)
{
    int y=fa[x],z=fa[y],l,r;
    l=(ch[y][1]==x); r=l^1;
    if(z) ch[z][ch[z][1]==y]=x;
    ch[y][l]=ch[x][r]; ch[x][r]=y;
    fa[ch[y][l]]=y; fa[y]=x; fa[x]=z;
    push_up(y); push_up(x);
    if (root==y) root=x;
}
void splay(int x)
{
    while(fa[x])
    {
        int y=fa[x],z=fa[y];
        if(z)
            if(ch[z][0]==y^ch[y][0]==x) rotate(x); else rotate(y);
        rotate(x);
    }
    root=x;
}
void insert(int &x,int f,int F)
{
    //cout<<x<<" "<<f<<endl;
    if(!x)
    {
        v[x=++cnt]=f;
        size[x]=1;
        mx[x]=f;
        fa[x]=F;
        splay(x);
        //cout<<x<<" "<<size[x]<<" "<<ch[x][0]<<" "<<ch[x][1]<<endl;
        return;
    }
    if(f<v[x]) insert(ch[x][0],f,x);
    else insert(ch[x][1],f,x);
}
int find(int x,int f)
{
    if(v[x]==f) return x;
    else if(v[x]<f) return find(ch[x][1],f);
    else return find(ch[x][0],f);
}
/*void del(int x)
{
    int pos=find(root,x),y;
    while(ch[pos][0]&&ch[pos][1])
    {
        if(size[ch[pos][0]]>size[ch[pos][1]])
            y=ch[pos][0];
        else y=ch[pos][1];
        rotate(y);
        if(pos==root) root=y;
    }
    y=ch[pos][0]+ch[pos][1];
    if(y)
    {
        if(pos==root)
        {
            root=y;
            fa[root]=0;
        }
        else
        {
            fa[y]=fa[pos];
            ch[fa[pos]][ch[pos][1]==pos]=y;
        }
    }
    else ch[fa[pos]][ch[pos][1]==pos]=0;
    while(pos=fa[pos]) push_up(pos);
}*/
 
void del(int x)
{
    int pos=find(root,x),y;
    while(ch[pos][0]||ch[pos][1])
    {
        if(size[ch[pos][0]]>size[ch[pos][1]])
            y=ch[pos][0];
        else y=ch[pos][1];
        rotate(y);
    }
    ch[fa[pos]][ch[fa[pos]][1]==pos]=0;
    while(pos=fa[pos])
    {
        push_up(pos);
        //cout<<pos<<" "<<size[pos]<<" "<<mx[pos]<<endl;
    }
}
int rank(int x,int f,int y)
{
    //cout<<v[x]<<" "<<f<<" "<<size[x]<<endl;system("pause");
    if(v[x]==f)
    {
        if(mx[ch[x][0]]==f) return rank(ch[x][0],f,y);
        return size[ch[x][0]]+1+y;
    }
    else if(v[x]>f) return rank(ch[x][0],f,y);
    else return rank(ch[x][1],f,y+size[ch[x][0]]+1);
}
int num(int x,int f)
{
    //cout<<x<<" "<<size[x]<<" "<<v[x]<<" "<<f<<endl; system("pause");
    if(size[ch[x][0]]+1==f) return v[x];
    else if(size[ch[x][0]]>=f) return num(ch[x][0],f);
    else return num(ch[x][1],f-size[ch[x][0]]-1);
}
int pre(int x,int f)
{
    if(!x) return -1e9;
    if(v[x]<f) return max(v[x],pre(ch[x][1],f));
    else return pre(ch[x][0],f);
}
int nxt(int x,int f)
{
    if(!x) return 1e9;
    if(v[x]>f) return min(v[x],nxt(ch[x][0],f));
    else return nxt(ch[x][1],f);
}
  
int main()
{
    mx[0]=-1e9;
    scanf("%d",&n);
    for(int i=1;i<=n;i++)
    {
        int opt,x; 
        scanf("%d%d",&opt,&x);
        if(opt==1) insert(root,x,0);
        else if(opt==2) del(x);
        else if(opt==3) printf("%d
",rank(root,x,0));
        else if(opt==4) printf("%d
",num(root,x));
        else if(opt==5) printf("%d
",pre(root,x));
        else if(opt==6) printf("%d
",nxt(root,x));
    }
    return 0;
}