제출 #958859

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
958859		MinaRagy06	Shortcut (IOI16_shortcut)	C++17	0 / 100	0 ms	600 KiB

shortcut

#include <bits/stdc++.h>
#include "shortcut.h"
#ifdef MINA
#include "grader.cpp"
#endif
using namespace std;
#define ll long long

ll find_shortcut(int n, vector<int> l, vector<int> a, int c) {
	reverse(l.begin(), l.end()), l.push_back(0), reverse(l.begin(), l.end()), l.push_back(0);
	reverse(a.begin(), a.end()), a.push_back(-1), reverse(a.begin(), a.end());
	ll prf[n + 2]{};
	for (int i = 2; i <= n; i++) {
		prf[i] = prf[i - 1] + l[i - 1];
	}
	ll prfmx[n + 2]{}, sufmx[n + 2]{};
	for (int i = 1; i <= n; i++) {
		prfmx[i] = max(prfmx[i - 1] + l[i - 1], (ll)a[i]);
	}
	for (int i = n; i >= 1; i--) {
		sufmx[i] = max(sufmx[i + 1] + l[i], (ll)a[i]);
	}
	ll ans = 1e18;
	for (int x = 1; x <= n; x++) {
		for (int y = x + 1; y <= n; y++) {
			ll d = prfmx[x] + sufmx[y] + min(prf[y] - prf[x], (ll)c);
			ll len = prf[y] - prf[x] + c;
			for (int i = x; i <= y; i++) {
				if (i != x) d = max(d, a[i] + prfmx[x] + min(prf[i] - prf[x], len - (prf[i] - prf[x])));
				if (i != y) d = max(d, a[i] + sufmx[y] + min(prf[y] - prf[i], len - (prf[y] - prf[i])));
				for (int j = i + 1; j <= y; j++) {
					d = max(d, a[i] + a[j] + min(prf[j] - prf[i], len - (prf[j] - prf[i])));
				}
			}
// 			cout << x << ' ' << y << ": " << d << '\n';
			ans = min(ans, d);
		}
	}
	return ans;
}

• 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