Submission #72812

#	Time	Username	Problem	Language	Result	Execution time	Memory
72812		square1001	Boxes with souvenirs (IOI15_boxes)	C++14	100 / 100	651 ms	117800 KiB

boxes

#include "boxes.h"
#include <vector>
#include <algorithm>
using namespace std;

long long d[10000009];
long long delivery(int N, int K, int L, int p[]) {
	sort(p, p + N);
	int ls = 0;
	for(int i = 0; i < N; ++i) {
		if(2 * p[i] < L) ++ls;
	}
	for(int i = 1; i <= ls; ++i) {
		d[i] = (i < K ? 0 : d[i - K]) + 2 * p[i - 1];
	}
	for(int i = 1; i <= N - ls; ++i) {
		d[i + ls + 1] = (i < K ? 0 : d[i - K + ls + 1]) + 2 * (L - p[N - i]);
	}
	long long ret = d[ls] + d[N + 1];
	for(int i = max(ls - K + 1, 0); i <= ls && i <= N - K; ++i) {
		ret = min(ret, d[i] + d[N - K - i + ls + 1] + L);
	}
	return ret;
}

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