bzoj1208Splay

Splay查前驱后继

小tips：在bzoj上while(scanf)这种东西可以让程序多组数据一起跑 反正没加我就t了

#include<cstdio>
#include<iostream>
#include<cstdlib>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<vector>
#include<queue>
using namespace std;
const int maxn=;
const int inf=1e9;
const int mod=;
inline int read()
{
    int x=,f=;
    char ch=getchar();
    while(!isdigit(ch)){if(ch=='')f=-f;ch=getchar();}
    while(isdigit(ch)){x=*x+ch-'';ch=getchar();}
    return x*f;
}
struct SplayTree
{
    int rt,size;
    int son[maxn][],f[maxn],val[maxn];
    inline void Rotate(int x,int type)
    {
        int y=f[x];
        son[y][!type]=son[x][type];
        f[son[x][type]]=y;
        f[x]=f[y];
        if(f[x])son[f[y]][son[f[y]][]==y]=x;
        son[x][type]=y;
        f[y]=x;
    }
    inline void Splay(int x,int goal)
    {
        while(f[x]!=goal)
        {
            if(f[f[x]]==goal)
            {
                if(son[f[x]][]==x)  Rotate(x,);
                else Rotate(x,);
            }
            else
            {
               int y=f[x],z=f[y];
               if(son[z][]==y)
               {
                  if(son[y][]==x)Rotate(y,),Rotate(x,);
                  else Rotate(x,),Rotate(x,);
               }
               else
               {
                   if(son[y][]==x)Rotate(y,),Rotate(x,);
                   else Rotate(x,),Rotate(x,);
               }
            }
        }
        if(goal==) rt=x;
    }
    inline void addnode(int fx,int &x,int a)
    {
        x=++size;
        f[x]=fx;
        val[x]=a;
        son[x][]=son[x][]=;
    }
    inline void inittree()
    {
        size=;
        addnode(,rt,-inf);
        addnode(rt,son[rt][],inf);
    }
    inline void addNode(int a)
    {
        int x=rt;
        while(son[x][val[x]<a]) x=son[x][val[x]<a];
        addnode(x,son[x][val[x]<a],a);
        Splay(size,);
    }
    inline void Delete(int a)
    {
        Splay(a,);
        int tmp=son[rt][];
        while(son[tmp][]) tmp=son[tmp][];
        Splay(tmp,rt);
        son[tmp][]=son[rt][];
        f[son[rt][]]=tmp;
        f[tmp]=;
        rt=tmp;
    }
    inline int findnode(int a)
    {
        int x=rt;
        while(x)
        {
            if(val[x]==a)return x;
            if(val[x]>a)x=son[x][];
            else x=son[x][];
        }
        return ;
    }
    inline int fx_min(int a)
    {
        int x=rt,minn=inf;
        while(x)
        {
            if(val[x]==a) return a;
            if(val[x]>a) minn=min(minn,val[x]);
            if(val[x]>a) x=son[x][];
            else x=son[x][];
        }
        return minn;
    }
    inline int fx_max(int a)
    {
        int x=rt,maxx=-inf;
        while(x)
        {
            if(val[x]==a) return a;
            if(val[x]<a) maxx=max(maxx,val[x]);
            if(val[x]<a) x=son[x][];
            else x=son[x][];
        }
        return maxx;
    }  

}Splay;
int n,a,b,ans,Type[];
int main()
{
    while(scanf("%d",&n)!=EOF)
    {
        ans=,Type[]=Type[]=;
        Splay.inittree();
        for(int i=;i<=n;i++)
        {
            a=read(),b=read();
            if(Type[!a]==)
            {
                Type[a]++;
                Splay.addNode(b);
            }
            else
            {
                int minn=Splay.fx_min(b);
                int maxx=Splay.fx_max(b);
                ans=(ans+min(minn-b,b-maxx))%mod;
                if(b-maxx<=minn-b)Splay.Delete(Splay.findnode(maxx));
                else Splay.Delete(Splay.findnode(minn));
                Type[!a]--;
            }
        }
        cout<<ans%mod<<endl;
    }
}