标签：town 10 Expedition int 2431 units POJ fuel truck
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.
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
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
4 4 4 5 2 11 5 15 10 25 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. 分析：仔细读题意！！！！！不然太虐心了。。。 注意一下这里是加油站到城镇的距离。。。
1 #include<iostream>
2 #include<cstdio>
3 #include<cstring>
4 #include<algorithm>
5 #include<queue>
6 using namespace std;
7 const int maxn =1e5+10;
8 int a[maxn],b[maxn];
9 int n,l,p;
10
11 struct node{
12 int x,y;
13 }pp[maxn];
14
15 bool cmp(struct node a,struct node b){
16 return a.x<b.x;
17 }
18
19 int main(){
20 cin>>n;
21 for( int i=0; i<n; i++ ){
22 scanf("%d%d",&pp[i].x,&pp[i].y);
23 }
24 cin>>l>>p;
25 for( int i=0; i<n; i++ ){
26 pp[i].x=l-pp[i].x;
27 }
28 sort(pp,pp+n,cmp);
29
30 pp[n].x=l;
31 pp[n].y=0;
32
33 // for(int i=0; i<=n; i++){
34 // printf("%d ",pp[i].x);
35 // }
36 // cout<<endl;
37 // for(int i=0; i<=n; i++ ){
38 // printf("%d ",pp[i].y);
39 // }
40 // cout<<endl;
41
42 priority_queue<int> que;
43 int ans=0;//加油次数
44 int pos=0;//当前位置
45 int tank=p;//汽油剩余量
46 b[n]=0;
47 for(int i=0; i<=n; i++ ){
48 int d=pp[i].x-pos;
49 // cout<<"d="<<d<<endl;
50 while(tank-d<0){
51 if(que.empty()){
52 printf("-1\n");
53 return 0;
54 }
55 tank+=que.top();
56 que.pop();
57 ans++;
58 // cout<<"+1"<<endl;
59 }
60 // cout<<"qian:"<<tank<<endl;
61 tank-=d;
62 // cout<<"hou:"<<tank<<endl;
63 pos=pp[i].x;
64 que.push(pp[i].y);
65 }
66 printf("%d\n",ans);
67
68 return 0;
69 }
标签：town,10,Expedition,int,2431,units,POJ,fuel,truck 来源： https://www.cnblogs.com/Bravewtz/p/10629178.html
本站声明： 1. iCode9 技术分享网（下文简称本站）提供的所有内容，仅供技术学习、探讨和分享； 2. 关于本站的所有留言、评论、转载及引用，纯属内容发起人的个人观点，与本站观点和立场无关； 3. 关于本站的所有言论和文字，纯属内容发起人的个人观点，与本站观点和立场无关； 4. 本站文章均是网友提供，不完全保证技术分享内容的完整性、准确性、时效性、风险性和版权归属；如您发现该文章侵犯了您的权益，可联系我们第一时间进行删除； 5. 本站为非盈利性的个人网站，所有内容不会用来进行牟利，也不会利用任何形式的广告来间接获益，纯粹是为了广大技术爱好者提供技术内容和技术思想的分享性交流网站。