Submission #787579

#	Time	Username	Problem	Language	Result	Execution time	Memory
787579		Sohsoh84	Shortcut (IOI16_shortcut)	C++17	38 / 100	182 ms	4428 KiB

shortcut

#include "shortcut.h"
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

#define sep		' '
#define debug(x)	cerr << #x << ": " << x << endl; 

const ll MAXN = 500 + 10;
const ll INF = 3e18;

int n;
ll L[MAXN], ps[MAXN], D[MAXN], XT[MAXN], XS[MAXN], c, mx_xt[MAXN], mx_xs[MAXN], f1[MAXN], f2[MAXN], FT[MAXN][MAXN], FS[MAXN][MAXN];

inline ll dist(int i, int j) {
	if (i > j) swap(i, j);
	return ps[j] - ps[i];
}

inline ll solve(int l, int r) {
	ll ans = 0;
	if (c >= dist(l, r)) return INF;

	ans = max(ans, mx_xs[l] + mx_xt[r] - dist(l, r) + c);
	
	int p = l;
	ll f = dist(l, r) + c;
	for (int i = l; i <= r; i++) {
		ans = max(ans, min(dist(l, i), dist(i, r) + c) + ps[l] + mx_xs[(i == l ? l - 1 : l)] + D[i]);
		ans = max(ans, min(dist(r, i), dist(i, l) + c) - ps[r] + mx_xt[(i == r ? r + 1 : r)] + D[i]);
		
		while (dist(p, i) > f / 2)
			p++;

		if (p < i) ans = max(ans, XT[i] + FS[p][i - 1]);
		if (l < p) ans = max(ans, f + XS[i] + FT[l][p - 1]);
	}

	ans = max(ans, f1[l - 1]);
	ans = max(ans, f2[r + 1]);

	return ans;
}

ll find_shortcut(int n_, vector<int> l_, vector<int> d_, int c_) {
	n = n_;
	c = c_;

	for (int i = 0; i < MAXN; i++)
		mx_xt[i] = mx_xs[i] = f1[i] = f2[i] = -INF;

	for (int i = 1; i <= n; i++) {
		L[i] = l_[i - 1];
		D[i] = d_[i - 1];
		if (i < n) ps[i + 1] = ps[i] + L[i];

		XS[i] = D[i] - ps[i];
		XT[i] = D[i] + ps[i];

		mx_xs[i] = max(mx_xs[i - 1], XS[i]);

		f1[i] = max(f1[i - 1], XT[i] + mx_xs[i - 1]);
	}

	for (int i = n; i > 0; i--) {
		mx_xt[i] = max(mx_xt[i + 1], XT[i]);
		f2[i] = max(f2[i + 1], XS[i] + mx_xt[i + 1]);
	}

	for (int i = 1; i <= n;  i++) {
		FT[i][i] = XT[i];
		FS[i][i] = XS[i];
		
		for (int j = i + 1; j <= n; j++) {
			FT[i][j] = max(FT[i][j - 1], XT[j]);
			FS[i][j] = max(FS[i][j - 1], XS[j]);
		}
	}

	ll ans = 0;
	for (int i = 1; i <= n; i++)
		for (int j = i + 1; j <= n; j++)
			ans = max(ans, dist(i, j) + D[i] + D[j]);

	for (int l = 1; l <= n; l++)
		for (int r = l + 1; r <= n; r++)
			ans = min(ans, solve(l, r));
	return ans;
}

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