C
来源:互联网 发布:linux的安全审计服务 编辑:程序博客网 时间:2024/05/20 21:59
C - Stones
Because of the wrong status of the bicycle, Sempr begin to walk east to west every morning and walk back every evening. Walking may cause a little tired, so Sempr always play some games this time.
There are many stones on the road, when he meet a stone, he will throw it ahead as far as possible if it is the odd stone he meet, or leave it where it was if it is the even stone. Now give you some informations about the stones on the road, you are to tell me the distance from the start point to the farthest stone after Sempr walk by. Please pay attention that if two or more stones stay at the same position, you will meet the larger one(the one with the smallest Di, as described in the Input) first.
Because of the wrong status of the bicycle, Sempr begin to walk east to west every morning and walk back every evening. Walking may cause a little tired, so Sempr always play some games this time.
There are many stones on the road, when he meet a stone, he will throw it ahead as far as possible if it is the odd stone he meet, or leave it where it was if it is the even stone. Now give you some informations about the stones on the road, you are to tell me the distance from the start point to the farthest stone after Sempr walk by. Please pay attention that if two or more stones stay at the same position, you will meet the larger one(the one with the smallest Di, as described in the Input) first.
For each test case, I will give you an Integer N(0<N<=100,000) in the first line, which means the number of stones on the road. Then followed by N lines and there are two integers Pi(0<=Pi<=100,000) and Di(0<=Di<=1,000) in the line, which means the position of the i-th stone and how far Sempr can throw it.
221 52 421 56 6
1112
c++代码:
#include<iostream>#include<cstdio>#include<cstring>#include<vector>#include<queue>using namespace std;struct node{int pos;int move;}stone;bool operator <(node a,node b){if(a.pos!=b.pos)return a.pos>b.pos;// 要是位置不相同就先仍位置小的 else return a.move>b.move; }int main(){int t;scanf("%d",&t);priority_queue <node> q;while(t--) { int num; int count=0;int father=0; scanf("%d",&num); for(int i=1;i<=num;i++) { scanf("%d%d",&stone.pos,&stone.move); q.push(stone); }//先都存进去 while(q.empty()!=1) //如果不是空的 { count++; if(count%2!=0) { node a=q.top(); a.pos=a.pos+a.move; father=a.pos; q.pop(); q.push(a); } else if(count%2==0) { q.pop(); } } printf("%d\n",father); }return 0;}
阅读全文
0 0
- c
- c
- c
- c
- C
- c
- c
- c
- C+
- c
- C
- c
- c
- c
- C
- C
- c
- C
- Android Studio 小技巧/快捷键 合集
- Qt中显示opencv生成图片
- Python readlines and readline
- hdu5222 Exploration【并查集+拓扑排序】
- 摆积木
- C
- 系统服务
- 程序猿必须掌握的三大排序之冒泡排序
- JVM Young Generation的minor GC日志字段不详解
- 通过jQuery实现合理的年月日选择(select>option)
- Genymotion 使用教程
- Android 自定义View 使用Kotlin编写雷达扫描效果
- final
- Keepalived--概念(1)