FJoi2017 1月21日模拟赛 comparison(平衡树+thita重构)

30
31 0
0 31
0 1
3 3
3 4
4 2
3 4
31 3
2 2
5 3
9 4
8 1
9 12
13 5
13 12
13 0
3 12
4 3
15 18
16 16
11 5
14 17
9 20
20 18
16 10
31 24
20 7
7 5
14 21
24 4

2
2
2
4
5
6
6
9
7
9
10
11
11
12
13
12
7
9
17
17
14
19
13
22
19
27
23
12
23
27

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <limits.h>
#define MaxN 50010
#define MaxBuf 1<<22
#define inf LONG_LONG_MAX/2
#define mid ((l>>1)+(r>>1)+(l&r&1))
#define RG register
#define inline __inline__ __attribute__((always_inline))
#define Blue() ((S==T&&(T=(S=B)+fread(B,1,MaxBuf,stdin),S==T))?0:*S++)

char B[MaxBuf],*S=B,*T=B;

template<class Type>inline void Rin(RG Type &x){
    x=0;RG int c=Blue();RG bool b=false;
    for(;c<48||c>57;c=Blue())
        if(c==45)b=true;
    for(;c>47&&c<58;c=Blue())
        x=(x<<1)+(x<<3)+c-48;
    if(b)x=-x;
}

int n,ans;
struct Treap{
#define L long long
    struct Nt{
        Nt *ch[2],*s1,*s2;
        int size,k;
        L v;

        inline void pud() {size=ch[0]->size+ch[1]->size+1;}
    }pool[MaxN],*null,*root,*Re_p;

    L Re_s,Re_t;

    inline void rotate(RG Nt *&o,RG bool d){
        RG Nt *k=o->ch[d];
        o->ch[d]=k->ch[!d];
        k->ch[!d]=o;
        o->pud();
        k->pud();
        o=k;
    }

    void insert(RG Nt *&o,RG Nt *p,RG L l,RG L r){
        if(o==null){
                o=p;
            p->k=rand()*2333+rand(); p->v=mid; p->size=1;
            printf("%d\n",ans);
            return;
        }
        RG bool d=(p->s1->v > o->s1->v) || (p->s1->v == o->s1->v && p->s2->v >= o->s2->v);
        d? (ans+=o->ch[0]->size+1,insert(o->ch[1],p,o->v+1,r)):(insert(o->ch[0],p,l,o->v-1));
        if(o->ch[d]->k < o->k)rotate(o,d),Re_p=o,Re_s=l,Re_t=r;
        o->pud();
    }

    void Relabel(Nt *o,L l,L r){
        if(o==null)return;
        o->v=mid;
        Relabel(o->ch[0],l,o->v-1);
        Relabel(o->ch[1],o->v+1,r);
    }
public:
    void init(){
        root=null=pool+n+2;
        null->ch[0]=null->ch[1]=null;
        pool->v=0;
        (pool+n+1)->v=inf+1;
    }

    inline void insert(RG int cnt,RG int u,RG int v){
        ans=2;
        pool[cnt].s1=pool+u;
        pool[cnt].s2=pool+v;
        pool[cnt].ch[0]=pool[cnt].ch[1]=null;
        Re_p=null;
        insert(root,pool+cnt,1,inf);
        Relabel(Re_p,Re_s,Re_t);
    }
}RT;

#define set_file(File) {freopen(#File".in","r",stdin); freopen(#File".out","w",stdout);}
#define close_file() {fclose(stdin); fclose(stdout);}

int main(){
    srand(‘K‘+‘a‘+‘i‘+‘b‘+‘a‘);

    set_file(comparison);

    Rin(n); RT.init();
    for(RG int i=1,u,v;i<=n;i++){
        Rin(u),Rin(v);
        RT.insert(i,u,v);
    }

    close_file();

    return 0;
}