Submission #115363

#	Time	Username	Problem	Language	Result	Execution time	Memory
115363		socho	Boxes with souvenirs (IOI15_boxes)	C++14	20 / 100	2 ms	512 KiB

boxes

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

long long delivery(int N, int K, int L, int p[]) {
    if (K == 1) {
		long long sm = 0;
		for (int i=0; i<N; i++) {
			long long res = min(p[i], L-p[i]);
			sm += res;
		}
		return sm * 2;
	}
	if (K == N) {
		long long lr = L;
		long long mx = p[N-1];
		long long mn = p[0];
		long long goingMn = mx * 2;
		long long goingMx = (L-mn)*2;
		long long alt = 0;
		long long mxr = 0;
		long long mxl = 0;
		for (int i=0; i<N; i++) {
			if (p[i] * 2 < L) {
				mxl = max(mxl, (long long) p[i]);
			}
			else {
				mxr = max(mxr, (long long) L-p[i]);
			}
		}
		alt = (mxr + mxl) * 2;
		return min(min(alt, lr), min(goingMn, goingMx));
	}
	return 0;
}

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