poj 2431 Expedition

最新推荐文章于 2020-04-20 17:06:35 发布

super-fool

最新推荐文章于 2020-04-20 17:06:35 发布

阅读量667

点赞数

分类专栏：我是垃圾so我要升级文章标签：贪心

本文链接：https://blog.csdn.net/siper_fool/article/details/12783487

版权

我是垃圾so我要升级专栏收录该内容

10 篇文章 0 订阅

订阅专栏

链接： http://poj.org/problem?id=2431

Language:

Expedition

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 4423		Accepted: 1411

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

Sample Output

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

贪心，先用现有的油往前走，油不够时，在已经走过的站中，找能供油量最大的加油，如果还不够找第二大供油的站......，这里可以用优先队列来存

注意最后一站的处理

#include<iostream>
#include<queue>
#define maxn 1000000+5
struct stops
{
	int oil,dis;
}stop[maxn];
bool cmp(stops a,stops b)
{
	return a.dis<b.dis;
}
using namespace std;
int main()
{
	priority_queue <int> q;
	int n,p,l;
	while(scanf("%d",&n)!=EOF)
	{
		int a,box,cur,next,sum,time;
		for(a=n-1;a>=0;a--) scanf("%d%d",&stop[a].dis,&stop[a].oil);
		scanf("%d%d",&l,&p);
		for(a=n-1;a>=0;a--) stop[a].dis=l-stop[a].dis;//把距离改为从起点到该站的距离
		sort(stop,stop+n,cmp);//惯性思维，以为输入是默认从小到大的，i remeber you!
		time=cur=0,sum=box=p;
		for(a=0;a<n;a++)
		{
			next=stop[a].dis-cur;//现在的位置到下一站的距离
			while(box<next)//如果油不够用
			{
				if(!q.empty())
				{
					sum=sum+q.top();
					box=box+q.top();//加油
					q.pop();
					time++;
				}
				else break;
			}
			if(box<next) {sum=-1;break;}
			box=box-next;
			cur=stop[a].dis;
			q.push(stop[a].oil);//记录下加油量
		}
		if(!q.empty()&&sum!=-1&&sum<l) {sum=sum+q.top();time++;}//因为是先能到达再加油，所以第n站只能加前n-1站的油，所以最后1站的加不到
		if(sum>=l)
		printf("%d\n",time);
		else printf("-1\n");
		while(!q.empty()) q.pop();
	}
	return 0;
}