Submission #424416

#	Time	Username	Problem	Language	Result	Execution time	Memory
424416		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 = 9e18, dp[N], dq[N];
	for (int i = 0; i < N; ++i) {
		dp[i] = 2 * p[i];
		if (i >= K) {
			dp[i] = 2 * p[i] + dp[i - K];
		}
	}	
	for (int i = N - 1; ~i; --i) {
		dq[i] = 2 * (L - p[i]);
		if (i + K < N) {
			dq[i] = 2 * (L - p[i]) + dq[i + K];
		}	
	}
	ans = min(dp[N - 1], dq[0]);
	for (int i = 0; i < N; ++i) {
		ans = min(ans, dp[i] + dq[N - i]);
	}
	for (int i = 0; i + K - 1 < N; ++i) {
		ans = min(ans, dp[i] + dq[N - i - K] + 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