Submission #519284

#	Time	Username	Problem	Language	Result	Execution time	Memory
519284		pavement	선물상자 (IOI15_boxes)	C++17	0 / 100	1 ms	332 KiB

boxes

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

typedef long long ll;

int start;
ll ans, pf[1000005], sf[1000005];

ll delivery(int N, int K, int L, int p[]) {
	for (int i = 0; i < N; i++)
		pf[i] = (i - K >= 0 ? pf[i - K] : 0) + 2 * p[i];
	for (int i = N - 1; i >= 0; i--)
		sf[i] = (i + K < N ? sf[i + K] : 0) + 2 * (L - p[i]);
	for (int i = 0; i < N; i++) {
		if (L + (i > 0 ? pf[i - 1] : 0) < pf[min(N - 1, i + K - 1)]) {
			start = i;
			break;
		}
	}
	ans = LLONG_MAX;
	for (int i = start; i <= N; i += K)
		ans = min(ans, (start > 0 ? pf[start - 1] : 0) + sf[i] + (i - start) / K * 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