HDU4585:Shaolin(map)
来源:互联网 发布:苏宁秒杀软件 编辑:程序博客网 时间:2024/06/15 01:43
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
32 13 34 20
Sample Output
2 13 24 2#include <stdio.h>#include <string.h>#include <map>#include <algorithm>using namespace std;int main(){ int i,n,id,f; while(~scanf("%d",&n),n) { map<int,int> a; a.clear(); a[1000000000] = 1; for(i = 0; i<n; i++) { scanf("%d%d",&id,&f); printf("%d ",id); map<int,int>::iterator it = a.lower_bound(f); if(it == a.end()) { printf("%d\n",it->second); } else { int t1 = it->first; int t2 = it->second; if(it!=a.begin()) { it--; if(f-it->first<=t1-f) printf("%d\n",it->second); else printf("%d\n",t2); } else printf("%d\n",t2); } a[f] = id; } } return 0;}
0 1
- HDU4585:Shaolin(map)
- hdu4585 Shaolin(水)
- hdu4585 shaolin Treap
- HDU4585 Shaolin(treap)
- hdu4585 shaolin【 Treap模板题】
- HDU4585-map/(map+set)
- STL(vector、set、map)----hdu4585
- hdu4585(STL的map应用)
- hdoj4585 Shaolin (set+map)
- Shaolin
- Shaolin
- HDU 4585 Shaolin STL map 水
- HDU 4585 Shaolin(STL map)
- HDU 4858 Shaolin(map暴力)
- hdu 4585 Shaolin两种方法(暴力和STL map set)
- HDU ACM 4585 Shaolin->STL中set或map的应用
- Treap(一棵树)HDU4585
- hdu4585 STL水题
- easyui学习心得(认识API)
- 2014广州入户新规则--广州积分入户8月1日起接受申报 详细指引
- 杭电2030 汉字的统计
- Gvim的配置
- 个人对于学习android开发的一点见解
- HDU4585:Shaolin(map)
- 深入研究java.lang.Object类
- Convert Sorted Array to Binary Search Tree
- Android SlidingMenu 开源项目导入
- hdoj.2004 成绩转换 20140721
- 【Objective-C】ARC指南3 - @property
- UVA 10158 War
- 经典算法题目(含答案)
- erlang的逗号和分号和句号区别