Submission #225704

#	Time	Username	Problem	Language	Result	Execution time	Memory
225704		staniewzki	Boxes with souvenirs (IOI15_boxes)	C++17	100 / 100	877 ms	56952 KiB

boxes

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

long long delivery(int N, int K, int L, int p[]) {
	sort(p, p + N);
	vector<long long> l(K), r(K);
	for(int i = 0; i < N; i++) 
		l[(i + 1) % K] += min(2 * p[i], L);

	long long ans = l[N % K];
	for(int i = N - 1; i >= 0; i--) {
		l[(i + 1) % K] -= min(2 * p[i], L);
		r[i % K] += min(2 * (L - p[i]), L);
		ans = min(ans, l[i % K] + r[i % K]);
	}
	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