hdu 4585 Shaolin(STL map)
2015-08-14 19:27
375 查看
[align=left]Problem Description[/align]
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.
[align=left]Input[/align]
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.
[align=left]Output[/align]
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.
[align=left]Sample Input[/align]
3
2 1
3 3
4 2
0
[align=left]Sample Output[/align]
2 1
3 2
4 2
[align=left]Source[/align]
2013ACM-ICPC杭州赛区全国邀请赛
题意:讲的是一群无聊的和尚在比武,当来了一个新和尚时要挑选一个战斗力与他最接近的老和尚比武,
如果有两个老和尚和尚与他的战斗力的绝对值相等,则选择战斗力比他小的。
输出这个新和尚的编号和与他比武的老和尚的编号
直接用map标记就行了,
不过还是WA了好几次,说明自己还是很差啊!
View Code
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.
[align=left]Input[/align]
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.
[align=left]Output[/align]
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.
[align=left]Sample Input[/align]
3
2 1
3 3
4 2
0
[align=left]Sample Output[/align]
2 1
3 2
4 2
[align=left]Source[/align]
2013ACM-ICPC杭州赛区全国邀请赛
题意:讲的是一群无聊的和尚在比武,当来了一个新和尚时要挑选一个战斗力与他最接近的老和尚比武,
如果有两个老和尚和尚与他的战斗力的绝对值相等,则选择战斗力比他小的。
输出这个新和尚的编号和与他比武的老和尚的编号
直接用map标记就行了,
不过还是WA了好几次,说明自己还是很差啊!
#include<iostream> #include<cstdio> #include<cstring> #include<vector> #include<set> #include<algorithm> #include<cmath> #include<stdlib.h> #include<map> using namespace std; #define N 100006 int n; map<int,int>mp; map<int,int>::iterator it,it2; int main() { while(scanf("%d",&n)==1 && n) { mp.clear(); mp[1000000000]=1; for(int i=0;i<n;i++) { int x,y; scanf("%d%d",&x,&y); it=mp.lower_bound(y); if(it==mp.begin())//当新的只能排在第一位时,直接输出第一个 { printf("%d %d\n",x,it->second); } else { it2=it; it--; if(abs(y-it->first)>abs(y-it2->first)) printf("%d %d\n",x,it2->second); else printf("%d %d\n",x,it->second); } mp[y]=x; } } return 0; }
View Code
相关文章推荐
- Codeforces 432C Prime Swaps
- hdu 1087 Super Jumping! Jumping! Jumping! 最长上升子序列的变形
- poj 2229 完全背包变形(求解整数拆分问题)
- 常用的dos命名
- poj 2135 Farm Tour【 最小费用最大流 】
- 【OpenCV】高斯混合背景建模
- html 动态显示元素文本
- Android 自己的自动化测试(5)<robotium>
- 小白书之栈的调用过程
- 安卓百度地图附近poi搜索以及到指定poi的换乘方案
- 28335硬件教程-中断系统
- 10.PHP 教程_PHP If...Else 语句
- ACM 回文串&最大公共子序列
- Codeforces 19D(线段树+离散化)
- Apache与Tomcat 区别联系
- C# 、Vb .Net 中 Datagridview显示行号方法。
- 【求无向图的桥,有重边】ZOJ - 2588 Burning Bridges
- Triangle LOVE
- 解读核心动画类
- (转)Apache与Tomcat 区别联系