题目链接
http://codeforces.com/contest/738/problem/C
思路
首先二分一下汽车需要的最少装油量g,然后判断g是否合法
判断方法:贪心
因为在每个加油点加油不花费任何时间和金钱,因此其实每个加油点的作用是将线段划分为若干段,只需要判断每段是否满足即可
对于汽油量不够或者足够一直加速很好判断,只需要判断得加速一段时间再匀速一段时间的即可,对于一段,设长度为L, 汽车的容油量为g,加速时间
t1
,匀速时间
t2
,可以列出一下方程组:
{t1+0.5t2=L2t1+0.5t2=g
解得:
{t1=g−Lt2=4L−2g
可得对于各种情况,花费时间t为:
t=⎧⎩⎨⎪⎪不成立L3L−gg<Lg≥2LL≤g<2L
细节
二分的时候最好用long long避免溢出
代码
#include <bits/stdc++.h>
using namespace std;
inline int in() {int x; scanf("%d", &x); return x;}
#define pr(x) {cout << #x << ' ' << x << endl;}
#define PII pair<int, int>
#define mp make_mair
#define LL long long
const int maxn = 200000 + 5;
int n, k, s, tt;
int g[maxn];
PII a[maxn];
vector<int> b;
bool judge(int g) {
int t = 0;
for (int i = 0; i < b.size(); i++) {
int L = b[i];
if (g < L) return false;
if (g >= 2 * L) t += L;
else t += (3 * L - g);
}
return t <= tt;
}
int main() {
n = in(); k = in(); s = in(); tt = in();
for (int i = 0; i < n; i++) a[i].first = in(), a[i].second = in();
for (int i = 0; i < k; i++) g[i] = in();
sort(g, g + k);
int ss = 0;
for (int i = 0; i < k; i++) {
int x = g[i] - ss;
ss = g[i];
b.push_back(x);
}
int x = s - g[k - 1];
b.push_back(x);
LL L = 0, R = INT_MAX, M = (L + R) / 2;
//int L = 0, R = INT_MAX, M = ((LL)(L + R) / 2);
while (L < R) {
if (R == L + 1) {
if (judge(L)) M = L;
else M = R;
break;
} else {
M = (R + L) / 2;
if (judge(M)) R = M;
else L = M;
}
}
int pp = INT_MAX;
for (int i = 0; i < n; i++) {
if (a[i].second >= M) pp = min(pp, a[i].first);
}
cout << (pp == INT_MAX ? -1 : pp) << endl;
return 0;
}