HNOI2004 宠物收养所 (平衡二叉树)

题目链接

平衡树基础题，用于测试各种平衡树的性能(雾)

treap:

 #include<bits/stdc++.h>
 typedef long long ll;
 using namespace std;
 struct Treap {
     static const int N=1e5+;
     int rnd() {static int seed=time()%0x7fffffff; return seed=seed*48271ll%0x7fffffff;}
     int ch[N][],siz[N],val[N],fa[N],tot,rd[N];
     int rel(int u) {return ch[fa[u]][]==u;}
     void init() {tot=fa[]=ch[][]=ch[][]=siz[]=val[]=rd[]=;}
     int newnode(int x) {
         int u=++tot;
         fa[u]=ch[u][]=ch[u][]=;
         siz[u]=,val[u]=x,rd[u]=rnd();
         return u;
     }
     void pu(int u) {siz[u]=siz[ch[u][]]+siz[ch[u][]]+;}
     void rot(int u) {
         int v=fa[u],f=rel(u),ff=rel(v);
         ch[v][f]=ch[u][f^],fa[ch[v][f]]=v;
         ch[u][f^]=v,fa[u]=fa[v],fa[v]=u;
         if(fa[u])ch[fa[u]][ff]=u;
         pu(v),pu(u);
     }
     void ins(int& rt,int u) {
         if(!rt) {rt=u; return;}
         int v;
         for(v=rt; ch[v][val[u]>=val[v]]; v=ch[v][val[u]>=val[v]]);
         ch[v][val[u]>=val[v]]=u,fa[u]=v;
         for(; fa[u]&&rd[u]<rd[fa[u]]; rot(u));
         if(!fa[u])rt=u;
         for(u=fa[u]; u; u=fa[u])pu(u);
     }
     void del(int& rt,int u) {
         if(u==rt) {
             if(!ch[u][])rt=ch[u][];
             else if(!ch[u][])rt=ch[u][];
             else rt=ch[u][rd[ch[u][]]>=rd[ch[u][]]];
         }
         for(; ch[u][]&&ch[u][]; rot(ch[u][rd[ch[u][]]>=rd[ch[u][]]]));
         int f=ch[u][]?:;
         if(fa[u])ch[fa[u]][rel(u)]=ch[u][f];
         if(ch[u][f])fa[ch[u][f]]=fa[u];
         for(u=fa[u]; u; u=fa[u])pu(u);
     }
     int kth(int u,int k) {
         while(k!=siz[ch[u][]]+) {
             if(k<siz[ch[u][]]+)u=ch[u][];
             else k-=siz[ch[u][]]+,u=ch[u][];
         }
         return u;
     }
     int next(int u) {
         if(ch[u][]) {
             for(u=ch[u][]; ch[u][]; u=ch[u][]);
             return u;
         } else {
             for(; fa[u]&&rel(u); u=fa[u]);
             return fa[u];
         }
     }
     int prev(int u) {
         if(ch[u][]) {
             for(u=ch[u][]; ch[u][]; u=ch[u][]);
             return u;
         } else {
             for(; fa[u]&&!rel(u); u=fa[u]);
             return fa[u];
         }
     }
     int lb(int rt,int x) {
         int v=;
         for(int u=rt; u; u=ch[u][x>val[u]])if(val[u]>=x)v=u;
         return v;
     }
     int ub(int rt,int x) {
         int v=;
         for(int u=rt; u; u=ch[u][x>=val[u]])if(val[u]>x)v=u;
         return v;
     }
     void go() {
         init();
         const int mod=;
         const int inf=0x3f3f3f3f;
         int rt=,cnt=,m,ans=;
         ins(rt,newnode(inf));
         ins(rt,newnode(~inf));
         scanf("%d",&m);
         while(m--) {
             int f,x;
             scanf("%d%d",&f,&x);
             if(f==) {
                 if(cnt<) {
                     int r=lb(rt,x),l=prev(r);
                     if(abs(val[l]-x)<=abs(val[r]-x)) {
                         ans=(ans+abs(val[l]-x))%mod;
                         del(rt,l);
                     } else {
                         ans=(ans+abs(val[r]-x))%mod;
                         del(rt,r);
                     }
                 } else ins(rt,newnode(x));
                 cnt++;
             } else {
                 if(cnt>) {
                     int r=lb(rt,x),l=prev(r);
                     if(abs(val[l]-x)<=abs(val[r]-x)) {
                         ans=(ans+abs(val[l]-x))%mod;
                         del(rt,l);
                     } else {
                         ans=(ans+abs(val[r]-x))%mod;
                         del(rt,r);
                     }
                 } else ins(rt,newnode(x));
                 cnt--;
             }
         }
         printf("%d\n",ans);
     }
 } treap;

 int main() {
     treap.go();
     return ;
 }

splay:

 #include<bits/stdc++.h>
 typedef long long ll;
 using namespace std;
 struct Splay {
     static const int N=1e5+;
     int ch[N][],siz[N],val[N],fa[N],tot;
     int rel(int u) {return ch[fa[u]][]==u;}
     void init() {tot=fa[]=ch[][]=ch[][]=siz[]=val[]=;}
     int newnode(int x) {
         int u=++tot;
         fa[u]=ch[u][]=ch[u][]=;
         siz[u]=,val[u]=x;
         return u;
     }
     void pu(int u) {siz[u]=siz[ch[u][]]+siz[ch[u][]]+;}
     void rot(int u) {
         int v=fa[u],f=rel(u),ff=rel(v);
         ch[v][f]=ch[u][f^],fa[ch[v][f]]=v;
         ch[u][f^]=v,fa[u]=fa[v],fa[v]=u;
         if(fa[u])ch[fa[u]][ff]=u;
         pu(v),pu(u);
     }
     void splay(int& rt,int u) {
         for(int v=fa[rt]; fa[u]!=v; rot(u))
             if(fa[fa[u]]!=v&&rel(fa[u])==rel(u))rot(fa[u]);
         rt=u;
     }
     void ins(int& rt,int u) {
         if(!rt) {rt=u; return;}
         int v;
         for(v=rt; ch[v][val[u]>=val[v]]; v=ch[v][val[u]>=val[v]]);
         ch[v][val[u]>=val[v]]=u,fa[u]=v;
         splay(rt,u);
     }
     void del(int& rt,int u) {
         splay(rt,u);
         if(!ch[u][])rt=ch[u][];
         else if(!ch[u][])rt=ch[u][];
         else {
             splay(ch[rt][],kth(ch[rt][],));
             ch[ch[rt][]][]=ch[rt][];
             rt=fa[ch[rt][]]=ch[rt][];
             pu(rt);
         }
         fa[rt]=;
     }
     int kth(int u,int k) {
         while(k!=siz[ch[u][]]+) {
             if(k<siz[ch[u][]]+)u=ch[u][];
             else k-=siz[ch[u][]]+,u=ch[u][];
         }
         return u;
     }
     int next(int u) {
         if(ch[u][]) {
             for(u=ch[u][]; ch[u][]; u=ch[u][]);
             return u;
         } else {
             for(; fa[u]&&rel(u); u=fa[u]);
             return fa[u];
         }
     }
     int prev(int u) {
         if(ch[u][]) {
             for(u=ch[u][]; ch[u][]; u=ch[u][]);
             return u;
         } else {
             for(; fa[u]&&!rel(u); u=fa[u]);
             return fa[u];
         }
     }
     int lb(int rt,int x) {
         int v=;
         for(int u=rt; u; u=ch[u][x>val[u]])if(val[u]>=x)v=u;
         return v;
     }
     int ub(int rt,int x) {
         int v=;
         for(int u=rt; u; u=ch[u][x>=val[u]])if(val[u]>x)v=u;
         return v;
     }
     void go() {
         init();
         const int mod=;
         const int inf=0x3f3f3f3f;
         int rt=,cnt=,m,ans=;
         ins(rt,newnode(inf));
         ins(rt,newnode(~inf));
         scanf("%d",&m);
         while(m--) {
             int f,x;
             scanf("%d%d",&f,&x);
             if(f==) {
                 if(cnt<) {
                     int r=lb(rt,x),l=prev(r);
                     if(abs(val[l]-x)<=abs(val[r]-x)) {
                         ans=(ans+abs(val[l]-x))%mod;
                         del(rt,l);
                     } else {
                         ans=(ans+abs(val[r]-x))%mod;
                         del(rt,r);
                     }
                 } else ins(rt,newnode(x));
                 cnt++;
             } else {
                 if(cnt>) {
                     int r=lb(rt,x),l=prev(r);
                     if(abs(val[l]-x)<=abs(val[r]-x)) {
                         ans=(ans+abs(val[l]-x))%mod;
                         del(rt,l);
                     } else {
                         ans=(ans+abs(val[r]-x))%mod;
                         del(rt,r);
                     }
                 } else ins(rt,newnode(x));
                 cnt--;
             }
         }
         printf("%d\n",ans);
     }
 } splay;

 int main() {
     splay.go();
     return ;
 }