| Time Limit: 1000MS | Memory Limit: 65536K | |
| Total Submissions: 30702 | Accepted: 8457 |
Description
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
* 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
Sample Input
4
4 4
5 2
11 5
15 10
25 10
Sample Output
2
Hint
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
#include <cstdio>
#include <iostream>
#include <queue>
#include <algorithm> using namespace std; const int max_n = 1e4+;
const int max_L = 1e6;
const int max_P = 1e6;
const int max_A = max_L;
const int max_B = ; int n,L,P;
int a[max_n],b[max_n]; typedef struct Node
{
int a,b;
};
Node node[max_n]; bool cmp(Node a,Node b)
{
return a.a<b.a;
} void solve()
{
// 为了方便起见，将终点看作加油站
node[n].a=L;
node[n].b=;
++n; // 对数组按照距离排序
// 白书害我，我以为不需要排序，疯狂wa
sort(node,node+n,cmp); // for(int i=0;i<n;++i)
// {
// cout<<node[i].a<<' '<<node[i].b<<endl;
// } int ans=; // 定义最大优先级队列，存储可以到达位置的油量
priority_queue<int> heap; for(int i=;i<n;++i)
{
// 当前可达终点，跳出循环
if(P>=L)
{
break;
}
// 当前点不可达
while(P<node[i].a)
{
// 加油，直到可达或者为空
if(heap.empty())
{
puts("-1");
return;
}
++ans;
P+=heap.top();
heap.pop();
} // 当前点可达，将当前点加入堆
heap.push(node[i].b);
} printf("%d\n",ans);
} int main()
{
scanf("%d",&n);
int dis,fuel;
for(int i=;i<n;++i)
{
scanf("%d %d",&dis,&fuel);
node[i].a=dis;
node[i].b=fuel;
} scanf("%d %d",&L,&P); for(int i=;i<n;++i)
{
node[i].a=L-node[i].a;
}
solve();
return ;
}