Submission #424399

#	Time	Username	Problem	Language	Result	Execution time	Memory
424399		SuhaibSawalha1	Boxes with souvenirs (IOI15_boxes)	C++17	0 / 100	1 ms	204 KiB

boxes

#include "boxes.h"
#include <bits/stdc++.h>
using namespace std;
 
long long delivery(int N, int K, int L, int p[]) {
	long long ans, D[N] = {}, D2[N] = {};
	int l = 0;
	for (int i = 0; i < N; ++i) {
		if (i % K == 0) {
			l = 0;
		}
		D[i] = 2 * (p[i] - l);
		if (i) {
			D[i] += D[i - 1];
		}
		l = p[i];
	}	
	l = L;
	for (int i = N - 1; ~i; --i) {
		if ((N - i) % K == 0) {
			l = L;
		}
		D2[i] = 2 * (l - p[i]);
		if (i < N - 1) {
			D2[i] += D2[i + 1];
		}
		l = p[i];
	}
	ans = min({D[N - 1], D2[0], N == K ? L : L + D[N - K - 1]});
	for (int i = 0; i + K - 1 < N; ++i) {
		ans = min(ans, D[i] + D2[i + K - 1] + L);
	}
	return ans;
}

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