Expedition
Time Limit: 1000MS | Memory Limit: 65536K | |
Total Submissions:19288 | Accepted: 5554 |
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
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:
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.
在到达第i个加油站时前面的加油站都可以选择加油或者不加油,因此从i到i+1时如果油量不足,则从前i个加油站中还未使用
的加油站中选取油量最大的加油站加油,如此循环,知道油量可以到达i+1;
#include<iostream>
#include<algorithm>
#include<string.h>
#include<cstdio>
#include<queue>
using namespace std;
struct node
{
int x, y;
}c[10003];
priority_queue<int> Q;
bool cmp(node a, node b)
{
return a.x < b.x;
}
int main()
{
int n;
while (scanf("%d", &n) != EOF)
{
int s = 0;
for (int i = 0; i < n; i++)
scanf("%d%d", &c[i].x,&c[i].y);
sort(c, c + n, cmp);//按距离小镇的距离从小到大排序,注意是距离小镇的距离。
int L, P; scanf("%d%d", &L, &P);
for (int i = n - 1; i >= 0; i--)L-c[i].x为起点到加油站的距离,i从n-1开始循环以保证距离递增
{
while (P < (L - c[i].x))//若油量不能够到达小镇则加油,
{
if (Q.empty()) break;//若之前所有的油以用光则跳出
int t = Q.top(); Q.pop();//取出单次最大加油量
s++; P = P + t;//加油后能够到达的距离
}
if (P < (L - c[i].x)) break;//如果不能到达第i个加油站则一定不能到达终点
Q.push(c[i].y);
}//次循环得出到达最后一个加油站时车的储油量。
while (P < L)//判断油量是否可以到达终点
{
if (Q.empty()) break;
int e = Q.top(); Q.pop();
s++; P = P + e;
}
if (P >= L) printf("%d\n", s);
else printf("-1\n");
while (!Q.empty()) Q.pop();
}
return 0;
}