平常水题 - Expedition (优先队列)

                                                                                        Expedition
                                                Time Limit: 1000MS Memory Limit: 65536K
                                                Total Submissions: 15066 Accepted: 4232
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.
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.


Source

USACO 2005 U S Open Gold


题意:有一辆小车,一开始有P单位的油,要从 0 单位到达 L 单位,车油箱的容量无限大。共有n个加油站,在距离 L 单位 i 处有Ai加油站,可以加 Bi 单位的油。问:如果可以到达 L 单位,最少需要加多少次油。如果不可以则输出 -1 。 


解题思路:转变一下思路,可以看成每到达一个加油站Ai,之后就可以在任意时刻加 Bi 单位的油。先把加油站Ai距离终点 i 距离变为到起点的距离。


#include<cstdio>
#include<queue>
#include<string>
#include<cstdlib>
#include<algorithm>
using namespace std;

const int MAXN = 1000000 + 5;
struct p{int l,t;}p1[MAXN];//p]i].l : 加油站Ai到终点的距离。 p[i].t : 在加油站Ai可加的油。

priority_queue<int>que;//堆结构,默认每次弹出最大值。

int cmp(p x,p y){
    return x.l < y.l;
}

int main(){
    int tank,e,n,ans = 0;//tank : 车一开始的油量。  e : 终点。  ans : 加油的次数。
    scanf("%d",&n);
    for(int i = 1;i <= n;i++){
        scanf("%d %d",&p1[i].l,&p1[i].t);
    }
    scanf("%d %d",&e,&tank);
    for(int i = 1;i <= n;i++) p1[i].l = e - p1[i].l;//变为加油站到起点的距离。
    p1[n + 1].l = e,p1[n + 1].t = 0;//把终点也当做一个加油站。
    sort(p1 + 1,p1 + 1 + n + 1,cmp);
    for(int i = 1;i <= n + 1;i++){
        while(p1[i].l - p1[i-1].l - tank > 0){//油不够则继续加油(之前经过加油站中可加的最多的油)。
            if(que.empty()){//若之前可加的油都被加光了还到不了下一个加油站则输出-1。
               printf("-1");
               return 0;
            }
            tank += que.top();
            que.pop();
            ans++;
        }
        tank = tank - (p1[i].l - p1[i-1].l);
        que.push(p1[i].t);
    }
    printf("%d",ans);
}




  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值