HDU 1896 Stones (优先队列的应用)
2016-10-25 20:16
411 查看
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1896
Stones
Time Limit: 5000/3000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)
Total Submission(s): 2243 Accepted Submission(s): 1465
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
【思路分析】第奇数个石头向前题,第偶数个石头跳过。
问你这些石头最远能达到的位置是什么,用优先队列来维护就可以了。
【AC代码】
Stones
Time Limit: 5000/3000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)
Total Submission(s): 2243 Accepted Submission(s): 1465
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
【思路分析】第奇数个石头向前题,第偶数个石头跳过。
问你这些石头最远能达到的位置是什么,用优先队列来维护就可以了。
【AC代码】
#include<cstdio> #include<cstring> #include<queue> #include<algorithm> using namespace std; struct node { int pi,di; }; bool operator<( node a, node b ) { if( a.pi== b.pi ) { return a.di > b.di; } return a.pi > b.pi; } int main() { int t,n; scanf("%d",&t); while(t--) { node a; scanf("%d",&n); priority_queue<node> pq; for(int i=0; i<n; i++) { scanf("%d%d",&a.pi,&a.di); pq.push(a); } int s=0; while(!pq.empty()) { s++; a=pq.top(); pq.pop(); if(s%2) { a.pi+=a.di; pq.push(a); } if(pq.empty()) { printf("%d\n",a.pi); } } } return 0; }
相关文章推荐
- HDU 1896 Stones ——STL 优先队列
- HDU - 1896 Stones —— 优先队列——贪心
- hdu 1896 优先队列的应用
- hdu 1896 优先队列的应用
- hdu 1896 Stones(优先队列 Dijkstr)
- HDU - 1896 : Stones(优先队列、有序对)
- HDU 1896 Stones --优先队列+搜索
- HDU 1896 Stones --优先队列+搜索
- hdu 杭电1896 Stones【优先队列】
- 【HDU]-1896-Stones(优先队列,好)
- HDU 1896 Stones 【优先队列】
- HDU 1873 看病要排队(优先队列的简单应用)
- hdu 1896 stones 队列
- hdu 1896(2013.9.15周赛D题)优先队列
- HDU 1434幸福列车——优先队列的应用
- hdoj 1896 Stones 【优先队列】
- hdu 1896 优先队列
- hdu 1896 stones 队列
- hdoj 1896 Stones【优先队列】
- HDOJ 1896 Stones【优先队列】