HDU Problem 1896
来源:互联网 发布:cs1.5弹道优化参数 编辑:程序博客网 时间:2024/05/21 22:57
Stones
Time Limit: 5000/3000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)
Total Submission(s): 2063 Accepted Submission(s): 1359
Total Submission(s): 2063 Accepted Submission(s): 1359
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 <cmath>#include <queue>#include <stack>#include <cstdio>#include <cstring>#include <algorithm>#define MAX_N 1005using namespace std;const int INF = 0xffff;struct node{ int p, d; friend bool operator < (node a, node b) { if (a.p == b.p) return a.d > b.d; return a.p > b.p; }}temp;int main() { int n, a, b, t, c; scanf("%d", &t); while (t--) { priority_queue<node> que; while (!que.empty()) que.pop(); scanf("%d", &n); for (int i = 0; i < n; i++) { scanf("%d%d", &a, &b); temp.d = b; temp.p = a; que.push(temp); } int cnt = 1; while (!que.empty()) { //如果碰见的是奇数,就取出后加上扔的距离放到队里 if (cnt&1) { temp = que.top(); c = temp.p; temp.p += temp.d; que.push(temp); que.pop(); } else { c = que.top().p; que.pop(); } cnt++; } printf("%d\n", c); } return 0;}
0 0
- HDU Problem 1896
- HDU-PROBLEM
- hdu Problem-1896(优先队列+模拟)
- HDU Problem A
- HDU 3549 Flow Problem
- HDU problem 3877
- HDU Train Problem II
- HDU 1005 Problem Description
- HDU 1534 Schedule Problem
- hdu 3549 Flow Problem
- hdu 3549 Flow Problem
- HDU 1001 Sum Problem
- hdu 3374 String Problem
- HDU 1016 PrimeRing Problem
- HDU--1001--Sum Problem
- hdu Train Problem II
- hdu 1001 Sum Problem
- hdu A + B problem
- 线程执行器
- audio framework学习 博客链接
- 设计模式总结2
- IO同步异步!
- PopupWindows 在指定控件上下左右显示
- HDU Problem 1896
- hdu 3989 HP and Polyjuice Potion & hdu 4626 Jinkeloid
- 7/26android培训第16天
- <data> 數據模型範例
- Java源码-N个数字中第k个最大值的求解方法
- HTML基础
- MJExtension 之模型建立后没有效果
- (16)HTML标签详解之<br /><hr /><!-- -->
- SQLserver总结(1)