HDU 4584 splay

Shaolin

Time Limit: 3000/1000 MS (Java/Others)    Memory Limit: 65535/32768 K (Java/Others)
Total Submission(s): 3021    Accepted Submission(s): 1273

Problem Description

Shaolin temple is very famous for its Kongfu monks.A lot of young men go to Shaolin temple every year, trying to be a monk there. The master of Shaolin evaluates a young man mainly by his talent on understanding the Buddism scripture, but fighting skill is also taken into account.
When a young man passes all the tests and is declared a new monk of Shaolin, there will be a fight , as a part of the welcome party. Every monk has an unique id and a unique fighting grade, which are all integers. The new monk must fight with a old monk whose fighting grade is closest to his fighting grade. If there are two old monks satisfying that condition, the new monk will take the one whose fighting grade is less than his.
The master is the first monk in Shaolin, his id is 1，and his fighting grade is 1,000,000,000.He just lost the fighting records. But he still remembers who joined Shaolin earlier, who joined later. Please recover the fighting records for him.

 

Input

There are several test cases.
In each test case:
The first line is a integer n (0 <n <=100,000),meaning the number of monks who joined Shaolin after the master did.(The master is not included).Then n lines follow. Each line has two integer k and g, meaning a monk's id and his fighting grade.( 0<= k ,g<=5,000,000)
The monks are listed by ascending order of jointing time.In other words, monks who joined Shaolin earlier come first.
The input ends with n = 0.

 

Output

A fight can be described as two ids of the monks who make that fight. For each test case, output all fights by the ascending order of happening time. Each fight in a line. For each fight, print the new monk's id first ,then the old monk's id.

 

Sample Input

3
2 1
3 3
4 2
0

 

Sample Output

2 1
3 2
4 2

 

Source

2013ACM-ICPC杭州赛区全国邀请赛

题意：求前驱后继板子题

题解：ｏｒｚ

 #include <bits/stdc++.h>
 #define ll  __int64
 using namespace  std;
 ll tim=,n,root;
 bool flag;
 struct node
 {
     ll father,left,right,data;
     ll id;
 } tree[];
  ll mins(ll aaa, ll bbb)
 {
     if(aaa<bbb)
         return aaa;
     else
         return bbb;
 }
  ll abss(ll x)
 {
     if(x<)
         return -x;
     else
         return x;
 }
 void rightrotate(ll x)
 {
     ll y=tree[x].father;
     ll z=tree[y].father;
     tree[y].left=tree[x].right;
     if(tree[x].right!=-)
     {
         tree[tree[x].right].father=y;
     }
     tree[x].father=z;
     if(z!=-)
     {
         if(tree[z].left==y) tree[z].left=x;
         else tree[z].right=x;
     }
     tree[x].right=y;
     tree[y].father=x;
 }
 void leftrotate(ll x)
 {
     ll y=tree[x].father;
     ll z=tree[y].father;
     tree[y].right=tree[x].left;
     if(tree[x].left!=-)
     {
         tree[tree[x].left].father=y;
     }
     tree[x].father=z;
     if(z!=-)
     {
         if(tree[z].left==y) tree[z].left=x;
         else tree[z].right=x;
     }
     tree[x].left=y;
     tree[y].father=x;
 }
 void splay(ll x)
 {
     while(tree[x].father!=-)
     {
         ll y=tree[x].father;
         ll z=tree[y].father;
         if(z==-)
         {
             if(tree[y].left==x) rightrotate(x);
             else leftrotate(x);
         }
         else
         {
             if(tree[z].left==y&&tree[y].left==x)
             {
                 rightrotate(y);
                 rightrotate(x);
             }
             else if(tree[z].left==y&&tree[y].right==x)
             {
                 leftrotate(x);
                 rightrotate(x);
             }
             else if(tree[z].right==y&&tree[y].right==x)
             {
                 leftrotate(y);
                 leftrotate(x);
             }
             else
             {
                 rightrotate(x);
                 leftrotate(x);
             }
         }
     }root=x;
 }
 ll qq(ll x)
 {
     ll y=tree[x].left;
     if(y==-) return y;
     while(tree[y].right!=-) {
             y=tree[y].right;
     }
     return y;
 }
 ll hj(ll x)
 {
     ll y=tree[x].right;
     if(y==-) return y;
     while(tree[y].left!=-){
             y=tree[y].left;
     }
     return y;
 }
 int BST_insert(ll idd,ll dat,ll x)
 {
     if(dat==tree[x].data)
     {
         flag=false ;
         splay(x);
         return ;
     }
     if(dat<tree[x].data)
     {
         if(tree[x].left==-)
         {
             tree[x].left=tim;
             tree[tim].father=x;
             tree[tim].left=tree[tim].right=-;
             tree[tim].data=dat;
             tree[tim].id=idd;
         }
         else
             BST_insert(idd,dat,tree[x].left);
     }
     else
     {
         if(tree[x].right==-)
         {
             tree[x].right=tim;
             tree[tim].father=x;
             tree[tim].left=tree[tim].right=-;
             tree[tim].data=dat;
             tree[tim].id=idd;
         }
         else
             BST_insert(idd,dat,tree[x].right);
     }
 }
 ll insert1(ll idd,ll dat)
 {
     flag=true;
     tim++;
     BST_insert(idd,dat,root);
     if(flag==false) return ;
     splay(tim);
     ll q=qq(tim);
     ll h=hj(tim);
     ll minx=;
     ll iddd=;
     if(q!=-) {
        if(minx>abss(tree[q].data-dat)){
            minx=abss(tree[q].data-dat);
            iddd=tree[q].id;
        }
     }
     if(h!=-) {
         if(minx>abss(tree[h].data-dat)){
            minx=abss(tree[h].data-dat);
            iddd=tree[h].id;
        }
     }
     printf("%I64d %I64d\n",idd,iddd);
 }
 int main()
 {
     int n;
     ll aa=;
     while(scanf("%d",&n)!=EOF)
     {
     if(n==)
         return ;
     tim=;
     tim++;
     tree[tim].father=-;
     tree[tim].left=tree[tim].right=-;
     tree[tim].data=;
     tree[tim].id=;
     root=tim;
     for(ll i=; i<=n; i++)
     {
         ll aa=,bb;
         scanf("%I64d %I64d",&aa,&bb);
         insert1(aa,bb);
     }
     }
     return ;
 }