杭电1896 Stones(优先队列)
来源:互联网 发布:淘宝培训班 深圳沙井 编辑:程序博客网 时间:2024/05/22 15:41
Stones
Time Limit: 5000/3000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 1596 Accepted Submission(s): 1020
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
Recommend
lcy | We have carefully selected several similar problems for you:189218991895 1894 1897
#include<stdio.h>#include<queue> \\ 使用队列头文件 using namespace std;struct node{int dis,far;}s;bool operator<(const node &x,const node &y) {if(x.dis==y.dis) return x.far>y.far;else return x.dis>y.dis;}int main(){int t,n,di,pi,k;priority_queue<node>q; \\比较方式默认用operator< scanf("%d",&t);while(t--){scanf("%d",&n);while(n--){scanf("%d%d",&di,&pi);s.dis=di;s.far=pi;q.push(s); \\添加一个元素到优先队列中 }k=1;while(!q.empty())\\q.empty()优先队列为空时返回真,否则返回假; {s=q.top(); \\返回一个引用,指向最高优先级的元素 q.pop(); \\ 删除优先队列的第一个元素 if(1&k) \\判断k是否为奇数{s.dis+=s.far;q.push(s);\\是奇数的石头再放入队列中; }k++;}printf("%d\n",s.dis);}return 0;}
0 0
- 杭电1896 Stones(优先队列)
- 杭电-1896 Stones(优先队列)
- hdu 杭电1896 Stones【优先队列】
- 【杭电oj】1896 - Stones(优先队列)
- 1896 Stones(优先队列)
- 杭电1896(题意详解+代码)(优先队列)之Stones
- Stones(优先队列)
- Stones(优先队列)
- HDU 1896 -- Stones (优先队列)
- HDU 1896 Stones(优先队列)
- HDOJ 1896 Stones(优先队列)
- 【HDU]-1896-Stones(优先队列,好)
- HDU:1896 Stones(优先队列)
- HDU 1896 Stones (优先队列)
- hdu--1896Stones(优先队列)
- HDU 1896:Stones(优先队列)
- HDU 1896 Stones(优先队列)
- hdu 1896 Stones 优先队列
- 算法学习--动态规划
- uva11039 -Building designing
- 博客搬家 -> www.wilkeryun.com-> 搬回csdn
- NYOJ-水池数目
- 此windows Installer 程序包有问题。完成此安装所需的一个DLL不能运行。请和...
- 杭电1896 Stones(优先队列)
- Curator Recipes
- 在Ubuntu14.04中安装ROS Indigo
- ZOJ1025 Wooden Sticks
- 数据结构 栈和队列
- 2016蓝桥杯算法训练——最大最小公倍数
- Light OJ 1170 Counting Perfect BST (DP+数学)
- uva1339 - Ancient Cipher
- Building Maintainable Software-java篇之Separate Concerns in Modules