Submission #72806

#	Time	Username	Problem	Language	Result	Execution time	Memory
72806		square1001	Boxes with souvenirs (IOI15_boxes)	C++14	70 / 100	758 ms	235300 KiB

boxes

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

long long delivery(int N, int K, int L, int p[]) {
	sort(p, p + N);
	int ls = 0, rs = 0;
	for(int i = 0; i < N; ++i) {
		if(2 * p[i] < L) ++ls;
		else ++rs;
	}
	vector<long long> ld(ls + 1), rd(rs + 1);
	for(int i = 1; i <= ls; ++i) {
		ld[i] = (i < K ? 0 : ld[i - K]) + 2 * p[i - 1];
	}
	for(int i = 1; i <= rs; ++i) {
		rd[i] = (i < K ? 0 : rd[i - K]) + 2 * (L - p[N - i]);
	}
	long long ret = ld[ls] + rd[rs];
	for(int i = ls - K + 1; i <= ls && i <= N - K; ++i) {
		ret = min(ret, ld[i] + rd[N - K - i] + 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: 0 / 30