POJ 题目2431 Expedition(贪心,优先队列)
来源:互联网 发布:label mx 破解软件 编辑:程序博客网 时间:2024/04/25 08:14
Expedition
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 7791 Accepted: 2281
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
ac代码
#include<stdio.h>#include<string.h>#include<queue>#include<string>#include<iostream>#include<stdlib.h>using namespace std;struct s{int v,x;}b[1000010];int cmp(const void *a,const void *b){return (*(struct s *)a).x-(*(struct s *)b).x;}int main(){int n;while(scanf("%d",&n)!=EOF){int i,l,p;for(i=0;i<n;i++){scanf("%d%d",&b[i].x,&b[i].v);}scanf("%d%d",&l,&p);for(i=0;i<n;i++)b[i].x=l-b[i].x;b[n].x=l;b[n].v=0;qsort(b,n+1,sizeof(b[0]),cmp);priority_queue<int>q;int pos=0,ans=0,m=p;for(i=0;i<=n;i++){int dis=b[i].x-pos;while(m-dis<0){if(q.empty()){ans=-1;break;}m+=q.top();q.pop();ans++;}if(ans==-1)break;m-=dis;pos=b[i].x;q.push(b[i].v);}printf("%d\n",ans);}}
0 0
- POJ 题目2431 Expedition(贪心,优先队列)
- POJ 2431 Expedition (优先队列+贪心)
- POJ 2431 Expedition (贪心 + 优先队列)
- poj 2431 Expedition (贪心+优先队列)
- POJ 2431 Expedition (贪心、优先队列)
- poj 2431Expedition(优先队列+贪心)
- 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 贪心 + 优先队列
- 2431Expedition POJ- 优先队列 + 贪心
- POJ 2431 Expedition (贪心+优先队列)
- poj 2431 Expedition 贪心 + 优先队列
- 通过rman建立物理dg
- HDU 1702 ACboy needs your help again! (栈与队列)
- IOS UITableView 实现LOL数据展示
- C++算法:高精度计算
- 涨姿势了,关于matlab
- POJ 题目2431 Expedition(贪心,优先队列)
- CCPP Blog 目录
- PHP 月份与季度的转化
- 开源许可证 -> 衍生代码
- vim Cheatsheet
- Activity---数据传递
- 利用链栈的基本运算,通过输入将字符进栈,然后输出其出栈序列
- TCP/IP 通信示例
- 利用 Cordova 和 IBM Bluemix Mobile Data 服务构建一个混合移动应用程序