POJ 2431 Expedition

Expedition
Time Limit: 1000MS Memory Limit: 65536K
Total Submissions: 8791 Accepted: 2575

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.

有N个城镇，接下来N行第一个整数是该点到目标点的距离l，第二个整数是该点上有的汽油的含量p。最后一行是起始点到目标点的距离，起始状态下的汽油量。

开始时有的汽油量能够走过得最远点，然后把经过的这段距离的的所有镇子上的油量存到一个优先队列里，如果达到的最远点不能到达目的地就从优先队列里出最高的油量，如果队列空了还没到达目的地就没发到达了。

我忘了不能到达目的地的情况了，wa了一次，输入的时候要注意，给出的点可能不是按顺序给的。

#include <iostream>
#include <cstdio>
#include <cstring>
#include <queue>
#include <algorithm>
using namespace std;
struct node
{
    int l;
    int q;
}a[10005];
bool cmp(struct node c,struct node d)
{
    return c.l<d.l;
}
int main(void)
{
   // freopen("A.txt","r",stdin);
    int n;
    priority_queue<int> p;
    scanf("%d",&n);
    for(int i=1;i<=n;i++)
         scanf("%d%d",&a[i].l,&a[i].q);
         int lz,pz;
    scanf("%d%d",&lz,&pz);
    for(int i=1;i<=n;i++)
    {
        a[i].l=lz-a[i].l;
         if(a[i].l==0) p.push(a[i].q);
    }
    sort(a+1,a+n+1,cmp);

   int start=0;
   int x=pz;
   int count=0;
   int ok=0;
   while(x<lz)
   {
       for(int i=1;i<=n;i++)
       {
           if(a[i].l>start&&a[i].l<=x)
            p.push(a[i].q);
           else if(a[i].l>x)
            break;
       }
       start=x;
       if(p.empty()){ printf("-1 \n");ok=1;break;}
       x+=p.top();

       p.pop();
       count++;
   }
   if(ok==0)
   printf("%d\n",count);
    return 0;
}