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
题意
我们要去距离l的某城,其中我们要路过n个加油站,每个加油站可以加bi的油,问最少需要加多少次油
Solution
大概思路:每经过一个点i,就获得了加bi油的资格。在即将没油的时候我们当然要加最多的油
将每个加油站距离起点的距离(注意题中给出的是距离终点的距离,记得处理一下),将距离由到大小排序。如果可以到达下一个加油站,将可加的油加入优先队列。不能到就加油
之前WA了一晚上,今天把数组加了一个0过了,emmm
AC代码
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<queue>
using namespace std;
priority_queue<int>bi;
int n,l,p;
int t=0;
int pos,oil,dis;
struct data
{
int a;
int b;
}d[100001];
bool rule(data x,data y)
{
return x.a<y.a;
}
void o()
{
pos=0;
oil=p;
for(int i=1;i<=n+1;++i)
{
dis=d[i].a-pos;
while(oil-dis<0)
{
if(bi.empty())
{
printf("-1\n");
return;
}
oil=oil+bi.top();
//printf("%d\n",bi.top());
bi.pop();
++t;
}
oil=oil-dis;
pos=d[i].a;
bi.push(d[i].b);
}
printf("%d\n",t);
return;
}
int main()
{
scanf("%d",&n);
for(int i=1;i<=n;++i) scanf("%d %d",&d[i].a,&d[i].b);
scanf("%d %d",&l,&p);
for(int i=1;i<=n;++i)
{
d[i].a=l-d[i].a;
//printf("%d\n",d[i].a);
}
sort(d+1,d+1+n,rule);
d[n+1].a=l;
d[n+1].b=0;
o();
return 0;
}