CodeForces 378C - Road to Cinema(二分)

C. Road to Cinema
time limit per test1 second
memory limit per test256 megabytes
inputstandard input
outputstandard output
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 2 minutes, 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 t minutes. 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。

解题思路：
对加油站进行二分，同时加上0和终点，判断能够通过所有加油站和能够到达终点的最小油量是多少。
然后找出不小于最小油量且花费最少的车。在二分过程中不能用int（cin有毒。

AC代码：

#include<bits/stdc++.h>
using namespace std;
const int maxn = 2e5+5;
int c[maxn],v[maxn],g[maxn];
int n,k,s,t;
bool judge(long long mid)
{
    long long time = 0;
    for(int i = k;i >= 1;i--)
    {
        int dix = g[i]-g[i-1];
        if(dix>mid) return 0;
        long long fv = (mid-dix)<<1;
        long long sv = (mid-fv);
        if(sv<0)    time += dix;
        else        time += fv/2+sv*2;
    }
    if(time <= t)    return 1;
    return 0;
}
int main()
{
    scanf("%d%d%d%d",&n,&k,&s,&t);
    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++;
    sort(g,g+k+1);
    long long left = 0,right = s<<1;
    while(left < right)
    {
        long long mid = (left+right)/2;
        if(judge(mid))  right = mid;
        else            left = mid+1;
    }
    if(right == s<<1)
    {
        printf("-1");
        return 0;
    }
    int ans = INT_MAX;
    for(int i = 0;i < n;i++)
    {
        if(v[i]>=left)  ans = min(ans,c[i]);
    }
    if(ans == INT_MAX)  printf("-1");
    else    printf("%d",ans);
    return 0;
}