Submission #1239832

#	Time	Username	Problem	Language	Result	Execution time	Memory
1239832		arvxs	Boxes with souvenirs (IOI15_boxes)	C++20	10 / 100	0 ms	328 KiB

boxes

#include <bits/stdc++.h>

using namespace std;


long long delivery(int N, int K, int L, int positions[]) {

	vector<int> left(N), right(N);


	for (int i = 0; i < N; i++) {
		left[i] = positions[i];
		if (positions[i] < L / 2) {
			left[i] += positions[i];
		} else {
			left[i] = L;
		}

		if (i + 1 > K) {
			left[i] += left[i - K];
		}
	}

	for (int i = N - 1; i >= 0; i--) {
		right[i] = L - positions[i];

		if (L <= positions[i] + L / 2) {
			right[i] += (L - positions[i]);
		} else {
			right[i] = L;
		}

		if (N - i > K) {
			right[i] += right[i + K];
		}
	}

	long long ans = 1ll * min(left[N - 1], right[0]);

	for (int i = 1; i < N - 1; i++) {
		ans = min(ans, 1ll * left[i] + right[i + 1]);
	}

	return ans;

}

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