Submission #538992

#	Time	Username	Problem	Language	Result	Execution time	Memory
538992		pavement	선물상자 (IOI15_boxes)	C++17	100 / 100	579 ms	293708 KiB

boxes

#include "boxes.h"
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;

ll ans, pf[10000005], sf[10000005];

ll delivery(int N, int K, int L, int p[]) {
	for (int i = N - 1; i >= 0; i--)
		sf[i] = (i + K < N ? sf[i + K] : 0ll) + 2ll * (ll)(L - p[i]);
	ans = sf[0];
	for (int i = 0; i < N; i++) {
		pf[i] = (i - K >= 0 ? pf[i - K] : 0ll) + min((ll)L, 2ll * (ll)(p[i]));
		ans = min(ans, pf[i] + sf[i + 1]);
	}
	return ans;
}

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