Submission #531110

#	Time	Username	Problem	Language	Result	Execution time	Memory
531110		sliviu	선물상자 (IOI15_boxes)	C++17	0 / 100	0 ms	204 KiB

boxes

#include <bits/stdc++.h>
#include <boxes.h>

using namespace std;
using ll = long long;

ll delivery(int n, int k, int l, int a[]) {
	ll ans = INT_MAX;
	vector<ll> dpl(n + 2), dpr(n + 2);
	for (int i = 1; i <= n; ++i)
		dpl[i] = dpl[max(i - k, 0)] + 2 * a[i - 1];
	for (int i = n; i; --i)
		dpr[i] = dpr[min(i + k, n + 1)] + 2 * (l - a[i - 1]);
	for (int i = 0; i < n; ++i)
		ans = min(ans, dpl[i] + min(dpr[i + 1], dpr[min(n + 1, i + k + 1)] + l));
	return ans;
}

• Subtask 1: 0 / 10
• Subtask 2: 0 / 10
• Subtask 3: 0 / 15
• Subtask 4: 0 / 15
• Subtask 5: 0 / 20
• Subtask 6: 0 / 30