POJ-2431 Expedition
来源:互联网 发布:mac个人收藏添加 编辑:程序博客网 时间:2024/05/29 12:11
Expedition
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 8897 Accepted: 2607
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
Hint
INPUT 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, 5, and 10 units of fuel, respectively.
OUTPUT DETAILS:
Drive 10 units, stop to acquire 10 more units of fuel, drive 4 more units, stop to acquire 5 more units of fuel, then drive to the town.
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, 5, and 10 units of fuel, respectively.
OUTPUT DETAILS:
Drive 10 units, stop to acquire 10 more units of fuel, drive 4 more units, stop to acquire 5 more units of fuel, then drive to the town.
Source
USACO 2005 U S Open Gold
#include <cstdio>#include <queue>#include <algorithm>using namespace std;#define MAX 100000+5struct node{ int a; int b;}stop[MAX];bool cmp(node a, node b){ return a.a < b.a; }int N, L, P;void solve(){ //把终点站视为加油站 stop[N].a = L; stop[N].b = 0; N++; priority_queue<int> que; //ans为加油次数,pos为当前位置,tank为油箱汽油量 int ans = 0; int pos = 0; int tank = P; for(int i = 0; i < N; i++){ int d = stop[i].a - pos; //没油时不断加油直到油量足够走到下一加油站 while(tank < d){ if(que.empty()){ puts("-1"); return; } tank += que.top(); que.pop(); ans++; } tank -= d; que.push(stop[i].b); pos = stop[i].a; } printf("%d\n",ans);}int main(){ scanf("%d",&N); for(int i = 0; i < N; i++) scanf("%d%d",&stop[i].a,&stop[i].b); scanf("%d%d",&L,&P); for(int i = 0; i < N;i++) stop[i].a = L-stop[i].a; sort(stop, stop+N, cmp); solve();}
0 0
- poj 2431 Expedition 贪心
- poj 2431 Expedition
- poj 2431 Expedition
- POJ-2431-Expedition
- poj 2431 Expedition
- POJ 2431 Expedition
- POJ 2431 Expedition(树)
- POJ 2431 Expedition
- poj 2431 Expedition
- POJ 2431 Expedition
- POJ(2431)Expedition
- poj 2431 Expedition
- poj 2431 Expedition
- [POJ 2431]Expedition
- poj 2431 Expedition
- POJ 2431 Expedition
- poj 2431 Expedition
- POJ Expedition 2431
- JAVA大数使用
- HashMap的使用及常见问题
- preInterview_javaScript
- pyc文件介绍
- Android Framework学习记录1:Binder
- POJ-2431 Expedition
- 分析system_call中断处理过程
- 二分图中的名词定义
- multiprocessing下的Pool的几个函数
- beifeng149 javaScript
- [Leetcode 220, Medium] Contains Duplicates III
- java wait的使用
- Spring入门实例
- HYSBZ — 1070 修车(最小费用最大流)