Submission #1187875

#	Time	Username	Problem	Language	Result	Execution time	Memory
1187875		Tsagana	Boxes with souvenirs (IOI15_boxes)	C++20	100 / 100	340 ms	196252 KiB

boxes

#include<bits/stdc++.h>

using namespace std;

#define N 10000005

long long dp[2][N], ans = 1e18;

long long delivery(int n, int k, int l, int p[N]) {
	for (int i = 1; i <= n; i++)
		dp[0][i] = dp[0][max(0, i-k)] + p[i-1] + min(p[i-1], l-p[i-1]);
	for (int i = n; i > 0; i--)
		dp[1][i] = dp[1][min(n+1, i+k)] + l - p[i-1] + min(p[i-1], l - p[i-1]);
	for (int i = 0; i <= n; i++)
		ans = min(ans, dp[0][i] + dp[1][i+1]);
	return ans;
}

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