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.

【题目链接】:http://codeforces.com/contest/738/problem/C

【题解】



把每个gas station按照位置升序排;

把车按照v[i]升序排(c[i]不用管);

l = 1,r = n;

m = (l+r)>>1;

这个m作为当前枚举的车是什么;

注意到每次到车站之后油都能变满(哪个傻子不装满?免费的!)

它的容量作为从两个gas站之间的花费上限;

while(l<=r)
{
...
if (ok(m))
ans = m,r = m-1;
else
l = m+1;
}

那么ok函数要怎么写?

    bool ok(int w)
{
LL temp =0;
for (i = 1->k)
{
int ds = p[i]-p[i-1];
if (ds*2<=w)//使用加速模式花费汽油是距离的两倍
temp+=ds;//所用的时间就是距离;
else//不能全部使用加速模式
{//那就设低速模式x分钟,加速模式y分钟
/*
则有
0.5*x+y=ds ···①距离要恰好为两个站之间的距离
0.5x+2*y<=w ···②花费的燃油要小于等于油箱容量
显然要让y最大,这样时间最短;
而联立①②式可得
y<=w-ds;
所以y的最大值为w-ds;
相应的x = 2*(ds-y);
*/
if (w-ds>0)//如果能够有一段为加速模式
{
y = w-ds;
x = 2*(ds-y);
cost = y*2+x/2;
temp+=(x+y);//时间就是x+y;
}
else//只能全程为低速模式尝试一下
{
if (ds<=w)
temp+=2*ds;//时间为两倍距离
else
return false;
}
}
if (temp>t)//时间大于t了就返回false;
return false;
}
return true;
}

这样我们就把油箱容量符合要求的最小油箱容量的车的下标ans搞出来了;

之后枚举1->n,找到那些油箱容量大于等于这个ans车的容量的车;在它们之间找价格最低的;



【完整代码】

#include <bits/stdc++.h>
#define LL long long using namespace std; const int MAXNK = 2e5+10;
const LL INF = 1e18; struct abc
{
int c,v;
}; abc a[MAXNK];
int p[MAXNK];
int n,k,s;
LL t;
LL fi = INF; bool cmp1(abc a,abc b)
{
return a.v < b.v;
} bool ok(int w)
{
LL temp = 0;
for (int i = 1;i <= k;i++)
{
int cost = (p[i]-p[i-1])*2;
if (cost<=w)//直接全速前进
temp+=p[i]-p[i-1];
else
{//枚举在p[i-1]..p[i],前面用低速后面用高速;
int ds = p[i]-p[i-1];
int x,y;
if (w-ds>0)
{
y = w-ds;
x = 2*(ds-y);
cost = y*2+x/2;
temp+=(x+y);
/*
if (w==8)
{
puts("233");
cout << "ds==" << ds<<endl;
cout << "temp=="<<temp<<endl;
cout << "w-ds=="<<w-ds<<endl;
cout <<"cost=="<<cost<<endl;
cout << y<<endl;
cout << x<<endl;
}
*/
}
else
{
if (ds<=w)
temp+=2*ds;
else
return false;
}
}
if (temp > t)
return false;
}
return true;
} int main()
{
//freopen("F:\\rush.txt","r",stdin);
cin >> n >> k >>s >>t;
for (int i = 1;i <= n;i++)
scanf("%d%d",&a[i].c,&a[i].v);
p[0] = 0;
for (int i = 1;i <= k;i++)
scanf("%d",&p[i]);
sort(a+1,a+1+n,cmp1);
sort(p+1,p+1+k);
k++;
p[k] = s;
/*
for (int i = 1;i <= k;i++)
cout << p[i] << " ";
cout << endl;
*/
int l = 1,r = n,ans = -1;
while (l <= r)
{
int m = (l+r)>>1;
if (ok(a[m].v))
{
ans = m;
r = m-1;
}
else
l = m+1;
}
if (ans == -1)
{
puts("-1");
return 0;
}
//cout << ans << endl;
for (int i = 1;i <= n;i++)
{
if (a[i].v >= a[ans].v && a[i].c < fi)
fi = a[i].c;
}
cout << fi << endl;
//wujie -1
return 0;
}

【26.83%】【Codeforces Round #380C】Road to Cinema的更多相关文章

  1. 【57.97%】【codeforces Round #380A】Interview with Oleg

    time limit per test1 second memory limit per test256 megabytes inputstandard input outputstandard ou ...

  2. 【42.86%】【Codeforces Round #380D】Sea Battle

    time limit per test1 second memory limit per test256 megabytes inputstandard input outputstandard ou ...

  3. 【21.21%】【codeforces round 382D】Taxes

    time limit per test2 seconds memory limit per test256 megabytes inputstandard input outputstandard o ...

  4. 【50.88%】【Codeforces round 382B】Urbanization

    time limit per test2 seconds memory limit per test256 megabytes inputstandard input outputstandard o ...

  5. 【Codeforces Round 1137】Codeforces #545 (Div. 1)

    Codeforces Round 1137 这场比赛做了\(A\).\(B\),排名\(376\). 主要是\(A\)题做的时间又长又交了两次\(wa4\)的. 这两次错误的提交是因为我第一开始想的求 ...

  6. 【Codeforces Round 1132】Educational Round 61

    Codeforces Round 1132 这场比赛做了\(A\).\(B\).\(C\).\(F\)四题,排名\(89\). \(A\)题\(wa\)了一次,少考虑了一种情况 \(D\)题最后做出来 ...

  7. 【Codeforces Round 1120】Technocup 2019 Final Round (Div. 1)

    Codeforces Round 1120 这场比赛做了\(A\).\(C\)两题,排名\(73\). \(A\)题其实过的有点莫名其妙...就是我感觉好像能找到一个反例(现在发现我的算法是对的... ...

  8. 【Codeforces Round 1129】Alex Lopashev Thanks-Round (Div. 1)

    Codeforces Round 1129 这场模拟比赛做了\(A1\).\(A2\).\(B\).\(C\),\(Div.1\)排名40. \(A\)题是道贪心,可以考虑每一个站点是分开来的,把目的 ...

  9. 【Codeforces Round 1117】Educational Round 60

    Codeforces Round 1117 这场比赛做了\(A\).\(B\).\(C\).\(D\).\(E\),\(div.2\)排名\(31\),加上\(div.1\)排名\(64\). 主要是 ...

随机推荐

  1. C/C++(文件操作二)

    二进制读写才是本质 二进制的读写对文件标记不敏感. eg: 对图片进行加密与解密: 用命令的形式去执行: //xx.exe -c src dest 加密 //xx.exe -d src dest 解密 ...

  2. Model、ModelMap、ModelAndView的作用及区别

    Model.ModelMap.ModelAndView的作用及区别 对于MVC框架,控制器controller执行业务逻辑 用于产生模型数据Model 视图view用来渲染模型数据 Model和Mod ...

  3. Linux运维命令总结

    .什么是运维?什么是游戏运维? 1)运维是指大型组织已经建立好的网络软硬件的维护,就是要保证业务的上线与运作的正常, 在他运转的过程中,对他进行维护,他集合了网络.系统.数据库.开发.安全.监控于一身 ...

  4. 雷观(二十三)-IT互联网技术,不拼创新拼努力,特别低公平

    上次发表"雷观(二十二)"是在2015年3月7日,一转眼,就快到了11月.  前段时间,终于狠下心来,写了本篇,第二十三啦.  小雷同志,要加油了~  早日达到百篇雷观的里程碑~  ...

  5. 【Hello 2018 C】Party Lemonade

    [链接] 我是链接,点我呀:) [题意] 在这里输入题意 [题解] 处理出凑够2^j最少需要花费多少钱. 即试着把第i种物品买2^(j-i)个,看看会不会更便宜 记录在huafei[0..31]中 然 ...

  6. Spring Cloud Sleuth通过Kafka将链路追踪日志输出到ELK

    1.工程简介 elk-eureka-server作为其他三个项目的服务注册中心 elk-kafka-client调用elk-kafka-server,elk-kafka-server再调用elk-ka ...

  7. 关于oracle sql语句查询时 表名和字段名要加双引號的问题具体解释

      作为oracle的刚開始学习的人相信大家一定会遇到这个问题.如图:          明明就是navicat可视化创建了表,但是就是不能查到!这个为什么呢?           select * ...

  8. Codeforces Round #316 (Div. 2) A B C

    A. Elections time limit per test 1 second memory limit per test 256 megabytes input standard input o ...

  9. Slick教程

    Slick 编程(1): 概述 Slick 编程(2): 准备开发环境 Slick 编程(3): 基本查询 Slick 编程(4): 数据库连接和事务处理 Slick 编程(5): 数据库Schema ...

  10. Python: scikit-image gamma and log 对比度调整

    这个函数,主要用来做对比度调整,利用 gamma 曲线 或者 log 函数曲线, gamma 函数的表达式: y=xγ, 其中, x 是输入的像素值,取值范围为 [0−1], y 是输出的像素值,通过 ...