hdu 4585 2013杭州邀请赛 Shaolin
2013-08-10 16:41
302 查看
Shaolin
Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 0 Accepted Submission(s): 0
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用了个set就过了,
#include <iostream> #include <stdio.h> #include <set> #include <string.h> using namespace std; struct node { int id,val; bool operator < (node b)const { if(val!=b.val) return val<b.val; return id<b.id; } }; set<node> q; set<node >::iterator p,pp; int main() { int n,id,val,i,maxid,minid,maxval,minval; node temp; while(scanf("%d",&n)!=EOF) { if(n==0) break; q.clear(); temp.id=1;temp.val=1000000000; q.insert(temp); for(i=2;i<=n+1;i++) { scanf("%d%d",&temp.id,&temp.val); q.insert(temp); //p=q.begin(); p=q.find(temp); if(p==q.begin()) { p++; printf("%d %d\n",temp.id,p->id); continue; } p++; if(p==q.end()) { p--;p--; printf("%d %d\n",temp.id,p->id); continue; } p--; p--; minval=p->val; minid=p->id; ++p,++p; maxval=p->val; maxid=p->id; if(maxval-temp.val<temp.val-minval) { printf("%d %d\n",temp.id,maxid); } else printf("%d %d\n",temp.id,minid); } } return 0; }
相关文章推荐
- HDU 4585 Shaolin(2013杭州邀请赛J题-二分)
- HDU 4585 Shaolin 2013杭州邀请赛
- hdu 4585 Shaolin 2013 ACM-ICPC杭州赛区全国邀请赛——题目重现
- hdu 4585 Shaolin 2013 ACM-ICPC杭州赛区全国邀请赛——题目重现
- HDOJ 4585/2013年杭州邀请赛J题 - Shaolin Treap水~
- HDU 4578 Transformation(2013 杭州赛区全国邀请赛 1003)
- hdu 4576(2013杭州邀请赛)
- hdu 4584 building-bridge 暴力的题,怎么暴力怎么干。。2013 ACM-ICPC杭州赛区全国邀请赛——题目重现
- hdu 4578 Transformation 2013ACM-ICPC杭州赛区全国邀请赛
- HDU 4576 (2013杭州邀请赛J题-dp滚动数组优化)
- hdu 4578 Transformation2013杭州邀请赛C(简单线段树)
- HDU 4576(2013杭州邀请赛) 滚动数组+模拟过程
- hdu 4485 2013杭州邀请赛 Building bridges
- hdu 4576 robot 2013 ACM-ICPC杭州赛区全国邀请赛——题目重现-1001-robot
- HDU 4578 Transformation 解题报告(线段树,2013杭州邀请赛)
- HDU 4584(2013杭州邀请赛I题-水)
- HDOJ 4585 && 2013杭州邀请赛
- HDU 4770 Lights Against Dudely -- 2013 杭州赛区现场赛-A(状态压缩)
- HDU 4747 Mex (2013杭州网络赛1010题,线段树)★
- HDU 4565 So Easy!(思想+矩阵快速幂)——2013 ACM-ICPC长沙赛区全国邀请赛