POJ 2431 Expedition (优先队列
2017-01-26 00:09
435 查看
Expedition
Time Limit: 1000MS | Memory Limit: 65536K | |
Total Submissions: 13904 | Accepted: 3940 |
To repair the truck, the cows need to drive to the nearest town (no more than 1,000,000 units distant) down a long, winding road. On this road, between the town and the current location of the truck, there are N (1 <= N <= 10,000) fuel stops where the cows can stop to acquire additional fuel (1..100 units at each stop).
The jungle is a dangerous place for humans and is especially dangerous for cows. Therefore, the cows want to make the minimum possible number of stops for fuel on the way to the town. Fortunately, the capacity of the fuel tank on their truck is so large that there is effectively no limit to the amount of fuel it can hold. The truck is currently L units away from the town and has P units of fuel (1 <= P <= 1,000,000).
Determine the minimum number of stops needed to reach the town, or if the cows cannot reach the town at all.
Input* Line 1: A single integer, N
* Lines 2..N+1: Each line contains two space-separated integers describing a fuel stop: The first integer is the distance from the town to the stop; the second is the amount of fuel available at that stop.
* Line N+2: Two space-separated integers, L and POutput* Line 1: A single integer giving the minimum number of fuel stops necessary to reach the town. If it is not possible to reach the town, output -1.Sample Input4
4 4
5 2
11 5
15 10
25 10
Sample Output2
HintINPUT DETAILS:
The truck is 25 units away from the town; the truck has 10 units of fuel. Along the road, there are 4 fuel stops at distances 4, 5, 11, and 15 from the town (so these are initially at distances 21, 20, 14, and 10 from the truck). These fuel stops can supply up to 4, 2,
4000
5, and 10 units of fuel, respectively.
写得第一道 优先队列的题,
结果题目没说那个N的位置是默认排序的 所以要重新排下序 //因为这个wa了好几次
AC代码:
#include<stdio.h> #include<string.h> #include<queue> #include<stack> #include<algorithm> using namespace std; struct node{ int a,b; }p[10010]; bool cmp(node x,node y) { return x.a < y.a; } int main() { int n, l, pl; while(~scanf("%d",&n)) { int flag = 0; for(int i = 0;i < n; i++) { scanf("%d%d",&p[i].a,&p[i].b); } scanf("%d%d",&l,&pl); for(int i = 0;i < n; i++) p[i].a = l - p[i].a; sort(p,p+n,cmp); p .a = l, p .b = 0; n++; priority_queue<int> fq; int k = 0, pos = 0; for(int i = 0;i < n; i++) { int d = p[i].a - pos; while(pl - d < 0) { if(fq.empty()) { // printf("-1\n"); flag = 1; break; } pl += fq.top(); fq.pop(); k++; } pl -= d; pos = p[i].a; fq.push(p[i].b); } if(flag) printf("-1\n"); else printf("%d\n",k); } return 0; }
相关文章推荐
- poj 2431 Expedition 优先队列 大顶堆
- POJ 2431 Expedition 贪心 + 优先队列
- Expedition(POJ 2431) 优先队列
- POJ2431 Expedition【贪心+优先队列】
- 优先队列 POJ 2431 Expedition
- POJ 2431 Expedition(优先队列、贪心)
- poj 2431 Expedition 【优先队列】
- POJ - 2431 Expedition :贪心+优先队列
- Poj—2431 Expedition 优先队列使用经典例题
- POJ 2431 Expedition (优先队列 + 贪心)
- POJ 2431-Expedition [优先队列] 《挑战程序设计竞赛》2.4
- poj2431 Expedition 优先队列
- [置顶] POJ 2431 EXPEDITION 非 优先队列的 c++ 做法
- POJ 2431 Expedition (贪心 + 优先级队列)
- poj-2431 贪心+优先队列
- POJ 2431 Expedition (STL 优先权队列)
- POJ 2431 Expedition (STL 优先权队列)
- poj 2431 优先队列 情景等价
- POJ 2431 be84 - Expedition ( 优先队列 )
- 优先队列简单三题:POJ3253 POJ 2431 POJ 3614