POJ 2431-Expedition(优先队列)
来源:互联网 发布:蓝狐网络培训 编辑:程序博客网 时间:2024/05/22 06:35
Expedition
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 17080 Accepted: 4965
Description
A group of cows grabbed a truck and ventured on an expedition deep into the jungle. Being rather poor drivers, the cows unfortunately managed to run over a rock and puncture the truck's fuel tank. The truck now leaks one unit of fuel every unit of distance it travels.
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.
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 P
* 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 P
Output
* 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 Input
44 45 211 515 1025 10
Sample Output
2
#include <stdio.h>#include <string.h>#include <algorithm>#include <queue>#define maxn 10005using namespace std;priority_queue<int> q;struct pp{ int a, b;}pi[maxn];int cmp(pp a, pp b){ return a.a<b.a;}int main(){int N;while(scanf("%d", &N)!=EOF){int L, P, ok = 1, cnt = 0;for(int i=N-1; i>=0; i--)scanf("%d%d", &pi[i].a, &pi[i].b); scanf("%d%d", &L, &P); for(int i=0; i<N; i++) pi[i].a = L-pi[i].a; pi[N].a = L; pi[N].b = 0; sort(pi, pi+N, cmp);while(!q.empty())q.pop(); int pos = 0;for(int i=0; i<=N; i++) { int d = pi[i].a-pos; while(P-d<0) { if(q.empty()) { ok = 0; break; } P += q.top(); cnt++; q.pop(); } q.push(pi[i].b); pos = pi[i].a; P -= d; }if(ok==1)printf("%d\n", cnt);elseprintf("-1\n");}return 0;}
阅读全文
0 0
- poj 2431 Expedition(优先队列)
- poj 2431 Expedition 【优先队列】
- POJ 2431 Expedition 优先队列
- POJ 2431 Expedition(优先队列)
- POJ 2431 Expedition 优先队列
- POJ 2431 Expedition(优先队列)
- Expedition(POJ 2431) 优先队列
- POJ 2431 Expedition (优先队列
- POJ 2431-Expedition(优先队列)
- poj 2431 Expedition 贪心 + 优先队列
- POJ 2431 Expedition (优先队列+贪心)
- POJ 2431 Expedition (贪心 + 优先队列)
- poj 2431 Expedition 贪心 + 优先队列
- 2431Expedition POJ- 优先队列 + 贪心
- poj 2431 Expedition(优先队列)
- poj 2431 Expedition (贪心+优先队列)
- POJ 2431 Expedition (贪心+优先队列)
- POJ 2431 Expedition (贪心、优先队列)
- Linux查看MySQL的安装路径
- 如何在tomcat下部署php
- Codeforces Round #423 B. Black Square
- CSS多行文字垂直居中的方法
- spring实现定时器功能
- POJ 2431-Expedition(优先队列)
- J2EE进阶之schema约束,JAXP的SAX解析,DOM4J的解析,XPATH的支持 七
- 设计模式(05) 原型模式
- Spring基础_学习笔记
- 为什么要用PLSQL
- 如何从node开源库下载安装未发布的最新版本node
- Java导入Excel文件
- 【转载】Java HashMap工作原理及实现
- thinkphp 之memcache