HDOJ 1896 Stones【优先队列】
来源:互联网 发布:linux svn 编辑:程序博客网 时间:2024/05/23 13:13
Stones
Time Limit: 5000/3000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 2046 Accepted Submission(s): 1347
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: 1892 1899 1895 1894 1897
扔石头~
大意是有一个叫Sempr的人,他现在走在一条有石子的路上。当他碰到的石子是第i个(i为奇数时),他就会把石子扔出去~
现在给了每个石子的初始位置和一次扔多远,问Sempr能把石子扔的最远的距离。
题解:优先队列,要注意一下多个石子在一个位置的情况,这时候扔能扔最远的石子。
#include<stdio.h>#include<string.h>#include<queue>#include<stack>#include<algorithm>using namespace std;struct Stone{int p,d;bool friend operator<(Stone a,Stone b){if(a.p==b.p)return a.d>b.d;return a.p>b.p;}}a,temp;int main(){int T;int i,n;scanf("%d",&T);while(T--){priority_queue<Stone> q;scanf("%d",&n);for(i=0;i<n;i++){scanf("%d%d",&a.p,&a.d);q.push(a);}int ans=0;int sum=0;while(!q.empty()){ans++;temp=q.top();q.pop();if(ans%2==0)continue;sum+=temp.d;temp.p+=temp.d;q.push(temp);}printf("%d\n",temp);}return 0;}
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 优先队列
- 图片放大缩小功能
- MyEclipse/Eclipse 打包项目没引入第三方jar解决办法
- nyoj32 组合数
- Swiper 插件
- hdu1873 看病要排队(队列+优先级)
- HDOJ 1896 Stones【优先队列】
- [Cloud Computing]Mechanisms: Single Sign-On
- 开灯问题
- [2016/7/26][usaco 2.2]Party Lamps
- Android 6.0及以上权限处理
- 现在给你一个16进制的加减法的表达式,要求用8进制输出表达式的结果。
- POJ 1001 高精度乘法
- JQuery移除事件
- 重建二叉树