hdoj 1896 Stones (优先队列)
来源:互联网 发布:sql查询语句实例 编辑:程序博客网 时间:2024/05/19 00:43
Stones
点击打开链接
Time Limit: 5000/3000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 1348 Accepted Submission(s): 839
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.
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.
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
221 52 421 56 6
Sample Output
1112
Author
Sempr|CrazyBird|hust07p43
Source
HDU 2008-4 Programming Contest
<span style="font-size:14px;">#include<cstdio>#include<cstring>#include<queue>#include<cstdlib>#include<algorithm>using namespace std;struct stone{int pos;int dis;friend bool operator < (stone a,stone b){ if(a.pos==b.pos) return a.dis>b.dis; else return a.pos>b.pos;}};int main(){ int t; scanf("%d",&t);while(t--){ int n; scanf("%d",&n); priority_queue<stone>q; for(int i=0;i<n;i++) { stone s; scanf("%d%d",&s.pos,&s.dis); q.push(s); } int count=1; stone res; while(!q.empty()) { res=q.top(); q.pop(); if(count&1) {res.pos+=res.dis;q.push(res); } count++; } printf("%d\n",res.pos);}return 0;}</span>
0 0
- hdoj 1896 Stones (优先队列)
- HDOJ 1896 Stones(优先队列)
- hdoj 1896 Stones 【优先队列】
- HDOJ 1896 Stones【优先队列】
- hdoj 1896 Stones [STL 优先队列]
- HDOJ 1896 Stones(优先队列)
- HDOJ Stones (优先队列)
- HDOJ 1896 Stones (踢石头,优先队列)
- HDU 1896 Stones(优先队列)
- 1896 Stones(优先队列)
- hdu 1896 Stones 优先队列
- hdu 1896 Stones(优先队列)
- HDU 1896 Stones (优先队列)
- HDU 1896 Stones 【优先队列】
- HDU 1896 Stones(优先队列)
- HDU 1896 Stones 优先队列
- HDUoj 1896 Stones ( 优先队列
- HDU 1896 Stones 优先队列
- windows下互斥量的使用
- 【iOS开发之Objective-C】单例的创建
- SQL相关问题的解决_20150730
- Linux Centos 配置防火墙
- 静态代理模式
- hdoj 1896 Stones (优先队列)
- Ubuntu 1204 升级到 1404
- android的测试方法,
- 【剑指offer】1.赋值运算符函数
- LightOJ 1048 - Conquering Keokradong 【二分】
- org.apache.jasper.JasperException: Unable to compile class for JSP
- NSDate
- log4j email EmailDailyRollingFileAppender
- 【CODEFORCES】 A. Dreamoon and Stairs