Submission #96922

#	Time	Username	Problem	Language	Result	Execution time	Memory
96922		youngyojun	Shortcut (IOI16_shortcut)	C++11	71 / 100	2048 ms	2304 KiB

shortcut

#include "shortcut.h"
#include <bits/stdc++.h>
#define INFLL (0x3f3f3f3f3f3f3f3fll)
using namespace std;
typedef long long ll;
inline void upmin(ll &a, ll b) { if(b < a) a = b; }
inline void upmax(ll &a, ll b) { if(a < b) a = b; }

const int MAXN = 1000055;

ll X[MAXN], L[MAXN];
int O[MAXN], OJ[MAXN];

int N; ll K, Ans;

bool isp(ll Y) {
	ll xymx = -INFLL, xymn = INFLL, yxmx = -INFLL, yxmn = INFLL;
	for(int oi = 0, i, oj = 0, j; oj < N; oj++) {
		ll mx = -INFLL, mn = INFLL;
		j = OJ[oj]; oi = 0;
		for(ll t = Y-X[j]-L[j]; oi < N; oi++) {
			i = O[oi];
			if(L[i]-X[i] <= t) break;
			if(j <= i) continue;
			upmax(mx, X[i]+L[i]);
			upmin(mn, X[i]-L[i]);
		}
		upmin(xymn, Y-K + mn + X[j]-L[j]);
		upmax(xymx, K-Y + mx + X[j]+L[j]);
		upmin(yxmn, Y-K - mx + X[j]-L[j]);
		upmax(yxmx, K-Y - mn + X[j]+L[j]);
	}
	for(int s = 0, xymxi = N-1, xymni = N-1, yxmxi = 0, yxmni = 0; s < N; s++) {
		for(ll t = xymx-X[s]; xymxi && t <= X[xymxi-1]; xymxi--);
		for(ll t = xymn-X[s]; 0 <= xymni && t < X[xymni]; xymni--);
		for(ll t = yxmx+X[s]; yxmxi < N && X[yxmxi] < t; yxmxi++);
		for(ll t = yxmn+X[s]; yxmni+1 < N && X[yxmni+1] <= t; yxmni++);
		if(X[xymxi] < xymx-X[s] || yxmn+X[s] < X[yxmni]) continue;
		if(max(xymxi, yxmxi) <= min(xymni, yxmni)) return true;
	}
	return false;
}

ll getAns() {
	ll mx = -INFLL;
	for(int i = 0; i < N; i++) {
		upmax(Ans, X[i]+L[i] + mx);
		upmax(mx, L[i]-X[i]);
	}
	iota(O, O+N, 0); sort(O, O+N, [&](int a, int b) {
		return L[a]-X[a] > L[b]-X[b];
	});
	iota(OJ, OJ+N, 0); sort(OJ, OJ+N, [&](int a, int b) {
		return X[a]+L[a] < X[b]+L[b];
	});
	ll s = 1, e = Ans;
	for(ll m; s < e;) {
		m = (s+e) >> 1;
		if(isp(m)) e = m;
		else s = m+1;
	}
	return s;
}

long long find_shortcut(int n, std::vector<int> l, std::vector<int> d, int c) {
	::N = n; ::K = c;
	for(int i = 1; i < N; i++) ::X[i] = ::X[i-1] + l[i-1];
	for(int i = 0; i < N; i++) ::L[i] = d[i];
    return getAns();
}

• Subtask 1: 9 / 9
• Subtask 2: 14 / 14
• Subtask 3: 8 / 8
• Subtask 4: 7 / 7
• Subtask 5: 33 / 33
• Subtask 6: 0 / 22
• Subtask 7: 0 / 4
• Subtask 8: 0 / 3