Codeforces(738C)-Road to Cinema
来源:互联网 发布:苏联和美国知乎 编辑:程序博客网 时间:2024/06/05 03:14
原题链接
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.
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.
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.
3 1 8 1010 85 711 93
10
2 2 10 1810 420 65 3
20
#include <cstdio>#include <cmath>#include <iostream>#include <vector>#include <algorithm>#include <cstring>#define MOD 100000007#define maxn 200005using namespace std;typedef long long ll;struct Node{int c, v;}node[maxn];int num[maxn];int n, k, s, t;bool judge(int m){int p = 0, v = m, tt = 0;for(int i = 0; i <= k; i++){int h = num[i] - p;if(v < h) return false;if(v / 2 >= h){tt += h;}else{tt += v - h;tt += 2 * (h - (v - h));}p = num[i];if(tt > t) return false;}return true;}int main(){//freopen("in.txt", "r", stdin);scanf("%d%d%d%d", &n, &k, &s, &t);for(int i = 0; i < n; i++) scanf("%d%d", &node[i].c, &node[i].v);for(int i = 0; i < k; i++) scanf("%d", num+i);sort(num, num+k);num[k] = s;int mins = 1e9 + 1;int l = 0, r = 2 * s + 1;while(l < r){int mid = ((ll)l + r) >> 1;if(judge(mid)) r = mid;else l = mid + 1;} for(int i = 0; i < n; i++){if(node[i].v >= l){mins = min(mins, node[i].c);}}if(mins == 1e9 + 1 || judge(l) == false) puts("-1");else printf("%d\n", mins);return 0; }
- Codeforces(738C)-Road to Cinema
- codeforces 738C Road to Cinema 贪心+二分
- Codeforces Round 380 C. Road to Cinema
- 【Codeforces 729 C Road to Cinema】 + 二分
- CodeForces 729C Road to Cinema 二分
- Codeforces Round #380 (Div. 2)C. Road to Cinema
- 【CodeForces 729C】【二分+贪心】Road to Cinema 题解
- Codeforces Round #380 (Div. 2) C. Road to Cinema 二分
- codeforce 738 C Road to Cinema 选车 (二分)
- Codeforces #380(Div.2)C.Road to Cinema【思维+二分查找】好题~
- codeforces 670C Cinema
- codeforces 670C Cinema
- codeforces 670C Cinema
- CodeForces 670C Cinema
- codeforces 670C Cinema
- codeforces 670C Cinema
- Codeforces729C Road to Cinema(贪心+二分)
- Codeforces738C-Road to Cinema(二分答案+贪心)
- 模式识别二--分类器的性能评价
- 刽子手游戏
- 富文本(讲一个字符串中的一些文本颜色显示特别的颜色,文字中替换表情)
- Win10使用过程中问题解决笔记
- dbms_rowid
- Codeforces(738C)-Road to Cinema
- Markdown的入门简单语法
- MarkDown学习
- 玲珑杯 B -- Private Value
- SVG 作品搜集(持续更新中)
- 数据结构--库鲁斯卡尔算法
- Git详解之三:Git分支
- LAMP中Apache配置VirtualHost实现“分流”
- 南京邮电大学密码学之md5