Submission #296152

#	Time	Username	Problem	Language	Result	Execution time	Memory
296152		RealSuperman1	Shortcut (IOI16_shortcut)	C++14	0 / 100	1 ms	384 KiB

shortcut

#pragma GCC optimize("Ofast")
 
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define fi first
#define se second
#define pll pair<long long, long long>
#define pii pair<int, int>
 
#include "shortcut.h"
 
using namespace std;
 
const ll INF = 1e18;
 
ll case123(int n, vector <int> l1, vector <int> d1, int c1) {
	ll ans = INF, c = 1ll * c1;
	vector <ll> p(n), d(n), l(n);
	for (int i = 0; i < n; i++)
		d[i] = d1[i] * 1ll;
	for (int i = 0; i < n; i++)
		l[i] = l1[i] * 1ll;
	p[0] = 0;
	for (int i = 1; i < n; i++)
		p[i] = p[i - 1] + l[i - 1];
	for (int i = 0; i < n - 1; i++) {
		for (int j = i + 1; j < n; j++) {
			ll maxdist = 0;
			pair<ll, int> mx = {-1, -1};
			int k1 = 0;
			for (int t1 = 0; t1 < n; t1++) {
				if (t1 == k1)
					continue;
				int t, k;
				k = min(t1, k1);
				t = max(t1, k1);
				ll mind;
				mind = p[t] - p[k];
				mind = min(mind, p[max(k, i)] - p[min(k, i)] + c + p[max(t, j)] - p[min(t, j)]);
				maxdist = max(maxdist, mind + d[k] + d[t]);
				mx = max(mx, {mind + d[k] + d[t], t});
			}
//			if (i == 1 && j == 3)
//				cout << mx.fi << " " << mx.se << endl; 
			k1 = mx.se;
			mx = {-1, -1};
			for (int t1 = 0; t1 < n; t1++) {
				if (t1 == k1)
					continue;
				int t, k;
				k = min(t1, k1);
				t = max(t1, k1);
				ll mind;
				mind = p[t] - p[k];
				mind = min(mind, p[max(k, i)] - p[min(k, i)] + c + p[max(t, j)] - p[min(t, j)]);
				maxdist = max(maxdist, mind + d[k] + d[t]);
				mx = max(mx, {mind + d[k] + d[t], t});
			}
			k1 = mx.se;
			mx = {-1, -1};
			for (int t1 = 0; t1 < n; t1++) {
				if (t1 == k1)
					continue;
				int t, k;
				k = min(t1, k1);
				t = max(t1, k1);
				ll mind;
				mind = p[t] - p[k];
				mind = min(mind, p[max(k, i)] - p[min(k, i)] + c + p[max(t, j)] - p[min(t, j)]);
				maxdist = max(maxdist, mind + d[k] + d[t]);
				mx = max(mx, {mind + d[k] + d[t], t});
			}
//			if (i == 1 && j == 3)
//				cout << mx.fi << " " << mx.se << endl;
			ans = min(ans, maxdist);
		}
	}
	return ans;
}
 
ll find_shortcut(int n, vector <int> l, vector <int> d, int c) {
	if (n <= 500)
		return case123(n, l, d, c);
	return 0ll;
}

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