HDU4585 Shaolin (STL和treap)

Shaolin

HDU - 4585

      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. 

InputThere 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. 
OutputA 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

treap：

#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<iostream>
#include<algorithm>
#include<cstring>
using namespace std;
const int maxn=;
int ans1,ans2,cnt;
struct in
{
    int L,R,V,rnd,pos;
}tree[maxn];
void rturn(int &u)
{
    int tmp=tree[u].L;
    tree[u].L=tree[tmp].R;
    tree[tmp].R=u;
    u=tmp;
}
void lturn(int &u)
{
    int tmp=tree[u].R;
    tree[u].R=tree[tmp].L;
    tree[tmp].L=u;
    u=tmp;
}
void insert(int &u,int v,int ps)
{
    if(u==){
        u=++cnt;
        tree[cnt].V=v;
        tree[cnt].pos=ps;
        tree[cnt].rnd=rand();
        return ;
    }
    if(tree[u].V>v){
        insert(tree[u].L,v,ps);
        if(tree[tree[u].L].rnd>tree[u].rnd)
         rturn(u);
    }
    else {
        insert(tree[u].R,v,ps);
        if(tree[tree[u].R].rnd>tree[u].rnd)
         lturn(u);
    }
}
void query(int u,int v)
{
    if(u==) return ;
    if(tree[u].V>v){
        ans2=u;//大
        query(tree[u].L,v);
    }
    else {
        ans1=u;//小
        query(tree[u].R,v);
    }
}
int main()
{
    int i,j,n,ps,v,root=;
    while(scanf("%d",&n)){
         if(n==) return ;
         memset(tree,,sizeof(tree));
         cnt=root=;
         insert(root,,);
         for(i=;i<=n;i++){
             scanf("%d%d",&ps,&v);
             printf("%d ",ps);
             ans1=ans2=-;
             query(root,v);
             if(ans1!=-) j=ans1;
             else if(ans2!=-) j=ans2;
             if(ans1!=-&&ans2!=-){
                    if(v-tree[ans1].V<=tree[ans2].V-v) j=ans1;
                    else j=ans2;
             }
             printf("%d\n",tree[j].pos);
             insert(root,v,ps);
         }
    }
    return ;
}

因为前两天用set实现了这道treap题，今天还是想偷懒。

#include<cstdio>
#include<cstdlib>
#include<iostream>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<set>
#include<map>
using namespace std;
const int maxn=;
int a[maxn],b[maxn];
set<int>q;
map<int,int>Map;
int main()
{
    int i,n,j,m,ps,u,v;
    while(~scanf("%d",&n)){
        if(n==) return ;
        q.clear();
        Map.clear();
        q.insert();
        Map[]=;
        for(i=;i<=n;i++)
        {
            scanf("%d%d",&u,&v);
            set<int> ::iterator it=q.lower_bound(v);
            if(it==q.begin()) ps=Map[*it];
            else {
                j=*it;
                it--;
                if(j-v>=v-*it) j=*it;
                ps=Map[j];

            }
            q.insert(v);
            Map[v]=u;
            printf("%d %d\n",u,ps);
        }
    }
    return ;
}

然后发现map居然也是排好序了的，黑人脸。

#include <stdio.h>
#include <string.h>
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <string>
#include <math.h>
#include <stdlib.h>
using namespace std;

int main()
{
    //freopen("in.txt","r",stdin);
    //freopen("out.txt","w",stdout);
    map<int,int>mp;
    int n;
    while(scanf("%d",&n) ==  && n)
    {
        mp.clear();
        mp[] = ;
        int u,v;
        while(n--)
        {
            scanf("%d%d",&u,&v);
            printf("%d ",u);
            map<int,int>::iterator it = mp.lower_bound(v);
            if(it == mp.end())
            {
                it--;
                printf("%d\n",it->second);
            }
            else
            {
                int t1 = it->first;
                int tmp = it->second;
                if(it != mp.begin())
                {
                    it--;
                    if(v - it->first <= t1 - v)
                    {
                        printf("%d\n",it->second);
                    }
                    else printf("%d\n",tmp);
                }
                else printf("%d\n",it->second);
            }
            mp[v] = u;
        }
    }
    return ;
}