Codeforces 729C Road to Cinema(二分在t时间内到达终点最少需要的油量)

最新推荐文章于 2022-07-20 11:16:49 发布

纯真zwj

最新推荐文章于 2022-07-20 11:16:49 发布

阅读量1k

点赞数

分类专栏：二分搜索

本文链接：https://blog.csdn.net/zwj1452267376/article/details/53252360

版权

二分搜索专栏收录该内容

21 篇文章 0 订阅

订阅专栏

Vasya is currently at a car rental service, and he wants to reach cinema. The film he has bought a ticket for starts in t minutes. There is a straight road of length s from the service to the cinema. Let's introduce a coordinate system so that the car rental service is at the point 0, and the cinema is at the point s.

There are k gas stations along the road, and at each of them you can fill a car with any amount of fuel for free! Consider that this operation doesn't take any time, i.e. is carried out instantly.

There are n cars in the rental service, i-th of them is characterized with two integers ci and vi — the price of this car rent and the capacity of its fuel tank in liters. It's not allowed to fuel a car with more fuel than its tank capacity vi. All cars are completely fueled at the car rental service.

Each of the cars can be driven in one of two speed modes: normal or accelerated. In the normal mode a car covers 1 kilometer in 2minutes, and consumes 1 liter of fuel. In the accelerated mode a car covers 1 kilometer in 1 minutes, but consumes 2 liters of fuel. The driving mode can be changed at any moment and any number of times.

Your task is to choose a car with minimum price such that Vasya can reach the cinema before the show starts, i.e. not later than in tminutes. Assume that all cars are completely fueled initially.

Input

The first line contains four positive integers n, k, s and t (1 ≤ n ≤ 2·105, 1 ≤ k ≤ 2·105, 2 ≤ s ≤ 109, 1 ≤ t ≤ 2·109) — the number of cars at the car rental service, the number of gas stations along the road, the length of the road and the time in which the film starts.

Each of the next n lines contains two positive integers ci and vi (1 ≤ ci, vi ≤ 109) — the price of the i-th car and its fuel tank capacity.

The next line contains k distinct integers g1, g2, ..., gk (1 ≤ gi ≤ s - 1) — the positions of the gas stations on the road in arbitrary order.

Output

Print the minimum rent price of an appropriate car, i.e. such car that Vasya will be able to reach the cinema before the film starts (not later than in t minutes). If there is no appropriate car, print -1.

   Examples 
 

     input 
   
3 1 8 10
10 8
5 7
11 9
3

     output 
   
10

     input 
   
2 2 10 18
10 4
20 6
5 3

     output 
   
20

Note

In the first sample, Vasya can reach the cinema in time using the first or the third cars, but it would be cheaper to choose the first one. Its price is equal to 10, and the capacity of its fuel tank is 8. Then Vasya can drive to the first gas station in the accelerated mode in 3 minutes, spending 6 liters of fuel. After that he can full the tank and cover 2 kilometers in the normal mode in 4 minutes, spending 2 liters of fuel. Finally, he drives in the accelerated mode covering the remaining 3 kilometers in 3 minutes and spending 6 liters of fuel.

题意：某人在起点处，到终点的距离为s。汽车租赁公司提供n中车型，每种车型有属性ci（租车费用），vi（油箱容量）。车子有两种前进方式：①. 慢速：1km消耗1L汽油，花费2分钟。 ②.快速：1km消耗2L汽油，花费1分钟。路上有k个加油站，加油不需要花费时间，且直接给油箱加满。问在t分钟内到达终点的最小花费是多少？（租车子的费用）若无法到达终点，输出-1

题解：

我们先分析不能到达终点的情况：

①.油箱容量最大的汽车在一个加油站到下一个加油站的途中油量耗尽了。

②.全程用快速跑，也不能在t时间内到达终点。

我们可以先求出在t时间内到达终点的最小油箱容量，再在大于等于这个油箱容量中找租车费用最小的车子。找最小油箱容量用二分查找就行了。然后再判定不能到到达终点的情况就行了。

代码如下：

#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int maxn = 2*1e5+10;
#define LL long long
int c[maxn],v[maxn],g[maxn]; 
int n,s,k,t,flag;

bool judge(LL mid)
{
	LL time=0;
	for(int i=1;i<k;++i)
	{
		LL dix=g[i]-g[i-1];
		if(dix>mid)//油量mid不足以支撑以慢速到达下一个加油站 
			return false;
		LL fv=(mid-dix)*2;//fv+sv=mid  fv/2+sv=dix 解这个方程组 
		LL sv=mid-fv;
		if(sv<0)//sv为负数表示，可以全程用快速从上一个加油站跑到当前加油站 
			time+=dix;
		else time+=fv/2+sv*2;
	}
	if(time<=t){
		flag=1;//全程快速能在t时间内到达 
		return true;
	}
	else
		return false;
} 

int main()
{
	while(scanf("%d%d%d%d",&n,&k,&s,&t)!=EOF)
	{
		for(int i=0;i<n;++i)
			scanf("%d%d",&c[i],&v[i]);
		for(int i=1;i<=k;++i)
			scanf("%d",&g[i]);
		g[0]=0;//加入起点 
		g[k+1]=s;//加入终点 
		k+=2; 
		sort(g,g+k);//将油站按位置排序，给出的是乱序，没注意wa一发 
		LL left=0,right=s*2,mid;
		flag=0;
		while(left<right)
		{
			mid=(left+right)/2;
			if(judge(mid))
				right=mid;
			else left=mid+1;
		}
		if(!flag){//全程快速也不能在t时间内到达 
			printf("-1\n");
			continue;
		}
		int ans=1e9+10;
		for(int i=0;i<n;++i)
		{
			if(v[i]>=left)
				ans=min(ans,c[i]);
		}
		if(ans==1e9+10)//表示没有足够大油量的汽车 
			printf("-1\n"); 
		else	printf("%d\n",ans); 
	}
	return 0;
}