POJ 2431Expedition
来源:互联网 发布:怎么使用同花顺软件 编辑:程序博客网 时间:2024/06/11 19:45
Expedition
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 18002 Accepted: 5257
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.
题目大意:奶牛们开车经过一个危险的地方,这个时候油箱坏了,每走一单位就要损耗一单位的油,车里原来有p的油,车的油箱容量是无限大的。现在路上不同位置有一些加油站,这些加油站里有一定量的油,问开到终点最少要加几次油。
贪心+优先队列
尽可能地往油多的地方走,然后把油存起来
#include<iostream>#include<cstdio>#include<queue>#include<cstring>#include<algorithm>using namespace std;struct Node{int dis;int fuel;}stop[10010];bool cmp(Node a,Node b){return a.dis<b.dis;}int main(){int n;while(cin>>n){int l,p;for(int i=0;i<n;i++) scanf("%d%d",&stop[i].dis,&stop[i].fuel);scanf("%d%d",&l,&p);for(int i=0;i<n;i++) stop[i].dis=l-stop[i].dis;stop[n].dis=l;stop[n++].fuel=0;sort(stop,stop+n,cmp);priority_queue<int> que;int rest=p;int ans=0;int pos=0;for(int i=0;i<n;i++){int x=stop[i].dis-pos;while(rest-x<0){if(que.empty()){ans=-1;break;}rest+=que.top();ans++;que.pop();}if(ans==-1) break;rest-=x;pos=stop[i].dis;que.push(stop[i].fuel);}cout<<ans<<endl;}}
阅读全文
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
- WebSocket
- HDU 2688
- 二进制的加法
- SDWebImage 获取缓存,清除缓存
- Linux服务器上安装MYSQL,并且开启远程访问
- POJ 2431Expedition
- moofest
- 电脑显示内存不足的处理方法
- 半年总结
- what is signal?
- 【POJ】3685
- StringBuilder在高性能场景下的正确用法
- node.js中的DIRT程序
- Android面试题1