hdoj 1896 Stones [STL 优先队列]
来源:互联网 发布:淘宝过户需要多久 编辑:程序博客网 时间:2024/05/21 17:33
Stones
Time Limit: 5000/3000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)
Total Submission(s): 1371 Accepted Submission(s): 857
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
思路:路上的石头,当遇到奇数序列的石头就把它向前扔,偶数的不动,如果两个石头一起,先扔的比较近的石头,这样一直下去,直到前面所有的石头都不可以仍了为止,求最远的石头距起点的距离;
代码:
#include<stdio.h>#include<stdlib.h>#include<algorithm>#include<queue>#include<math.h>using namespace std;struct stone{int x; //石头初始地 int y; //石头能扔的最远距离; };bool operator<(stone a,stone b) //运算符重载; {if(a.x==b.x)return a.y>b.y;return a.x>b.x;}int main(){int t;scanf("%d",&t);while(t--){int n;int i;priority_queue<stone>q; //定义stone成员的优先队列; scanf("%d",&n);stone tmp;for(i=0;i<n;i++){scanf("%d%d",&tmp.x,&tmp.y);q.push(tmp); }int sum=1;while(!q.empty()){tmp=q.top();q.pop();if(sum%2){tmp.x+=tmp.y;q.push(tmp); }sum++;}printf("%d\n",tmp.x);}return 0;}
0 0
- hdoj 1896 Stones [STL 优先队列]
- hdoj 1896 Stones (优先队列)
- HDOJ 1896 Stones(优先队列)
- hdoj 1896 Stones 【优先队列】
- HDOJ 1896 Stones【优先队列】
- HDOJ 1896 Stones(优先队列)
- HDOJ Stones (优先队列)
- HDOJ 1896 Stones (踢石头,优先队列)
- HDU 1896 Stones ——STL 优先队列
- 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 ( 优先队列
- KMP算法小结
- java中Singleton的几种实现方式
- 中文信息摘要
- 中国大学MOOC-翁恺-C语言程序设计习题集 05-0 到 06-3
- 【随行日志】与网络有关-?的含义
- hdoj 1896 Stones [STL 优先队列]
- socket基础总结
- 无聊写排序之 ----部分排序(Partial Sort)
- 单例模式(Singleton)
- VS中运行后控制台窗口一闪就没了
- Maximun Product(UVa 11059)
- BackGroundWork控件使用,防止页面假死
- 3分钟看懂:7大教育培训企业邮件营销 (附案例)
- RHEL十四(使用虚拟化系统)