HDU 1896 Stones (优先队列)
2016-07-12 10:02
127 查看
Problem Description
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.
Input
In the first line, there is an Integer T(1<=T<=10), which means the test cases in the input file. Then followed by T test cases.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.
Output
Just output one line for one test case, as described in the Description.Sample Input
2 2 1 5 2 4 2 1 5 6 6
Sample Output
11 12
Author
Sempr|CrazyBird|hust07p43Source
HDU 2008-4 Programming Contest#include<iostream> #include<queue> using namespace std; struct node//石头 { int pos,dis;//pos表示位置,dis表示距离 }; struct cmp//queue的比较函数 { bool operator()(node a,node b) { if(a.pos==b.pos)return a.dis>b.dis; return a.pos>b.pos;//top是最小 } }; int n,num;//n表示石头的个数,num表示遇到的石头序号 int main() { int T; cin>>T; while(T--) { cin>>n; priority_queue<node,vector<node>,cmp>Q; node stone; for(int i=0;i<n;i++) { cin>>stone.pos>>stone.dis; Q.push(stone); } num=0; while(!Q.empty())//没有可投掷的石头时,一直pop top { stone=Q.top(); Q.pop(); num++; if(num%2==1) { stone.pos+=stone.dis; Q.push(stone); } } cout<<stone.pos<<endl; } return 0; }
相关文章推荐
- ABAP多表关联查询
- yii 操作cookie
- JavaScript
- 优先队列之重载运算
- 关于HTML5语义标签的实践(blog页面)
- Thread线程中start()和run()方法的区别
- mysql单表多timestamp报错
- SCU 4494 双剑合并 01字典树
- 1.IntelliJ IDEA常用快捷键
- 团队博客第四周
- linux系统的指令集基础
- Ubuntu 网关服务器配置
- 基于BootStrap环境写jQuery tabs插件
- 数论知识点1——快速幂取模-LightOJ 1282
- form 表单验证
- java.lang.IllegalStateException: Ambiguous mapping found. Cannot map 'cityController' bean method
- 【HDU】5492 Find a path(2015 ACM/ICPC Asia Regional Hefei Online)
- CodeForces 385C Bear and Prime Numbers
- 论旧时豪门与寒门
- Tomcat反复加载Spring配置文件