Submission #424395

#	Time	Username	Problem	Language	Result	Execution time	Memory
424395		SuhaibSawalha1	Boxes with souvenirs (IOI15_boxes)	C++17	20 / 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, A[N], A2[N], KS = 0;
	for (int i = 0; i < N; ++i) {
		if (i % K == 0 && i) {
			KS += min(2 * p[i - 1], L);
		}
		A[i] = KS + min(2 * p[i], L);
	}	
	KS = 0;
	for (int i = N - 1; ~i; --i) {
		if ((N - i - 1) % K == 0 && i < N - 1) {
			KS += min(2 * (L - p[i + 1]), L);
		}
		A2[i] = KS + min(2 * (L - p[i]), L);
	}
	ans = min({A[N - 1], A2[0], K == N ? L : A[N - K - 1] + L});
	for (int i = 0; i + K - 1 < N; ++i) {
		ans = min(ans, A[i] + A2[i + K - 1] + L);
	}
	for (int i = 0; i < N - 1; ++i) {
		ans = min(ans, A[i] + A2[i + 1]);
	}
	return ans;
}

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