Shaolin
Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 3340 Accepted Submission(s): 1423
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.
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.
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
思路:用Treap来维护。每次添加后,算它的前驱和后继。如果没有前驱就输出后继的标号。如果都有就输出离他战斗力更近的标号,如果一样近就输出前驱的标号。
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
int root,size,ans1,ans2;
struct data
{
int l,r,v,rnd,id,w;
}tr[110000];
void rturn(int &k)
{
int t=tr[k].l;tr[k].l=tr[t].r;tr[t].r=k;
k=t;
}
void lturn(int &k)
{
int t=tr[k].r;tr[k].r=tr[t].l;tr[t].l=k;
k=t;
}
void insert(int &k,int x,int id)
{
if(k==0)
{
size++;k=size;
tr[k].rnd=rand();tr[k].v=x;tr[k].id=id;
return ;
}
if(x>tr[k].v)
{
insert(tr[k].r,x,id);
if(tr[tr[k].r].rnd<tr[k].rnd) lturn(k);
}
else
{
insert(tr[k].l,x,id);
if(tr[tr[k].l].rnd<tr[k].rnd) rturn(k);
}
}
void query_pro(int k,int x)
{
if(k==0) return;
if(tr[k].v<x)
{
ans1=k;query_pro(tr[k].r,x);
}
else
query_pro(tr[k].l,x);
}
void query_sub(int k,int x)
{
if(k==0) return;
if(tr[k].v>x)
{
ans2=k;query_sub(tr[k].l,x);
}
else query_sub(tr[k].r,x);
}
int cal(int x,int y)
{
return x>y?x-y:y-x;
}
int main()
{
int n;
while(~scanf("%d",&n)&&n)
{
int k,g;
size=0,root=0;
for(int i=0;i<110000;i++)//初始化
{
tr[i].l=0;
tr[i].r=0;
}
insert(root,1000000000,1);
for(int i=1;i<=n;i++)
{
scanf("%d%d",&k,&g);
insert(root,g,k);
ans1=0,ans2=0;
query_pro(root,g);query_sub(root,g);
if(ans1==0) printf("%d %d\n",k,tr[ans2].id);
else
{
if(g-tr[ans1].v>tr[ans2].v-g)
printf("%d %d\n",k,tr[ans2].id);
else printf("%d %d\n",k,tr[ans1].id);
}
}
}
return 0;
}