Submission #1218007

#	Time	Username	Problem	Language	Result	Execution time	Memory
1218007		vidux	Boxes with souvenirs (IOI15_boxes)	C++17	100 / 100	337 ms	196100 KiB

boxes

#include "boxes.h"

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

typedef long long ll;
typedef pair<ll, ll> pll;
typedef vector<ll> vl;

const ll LLINF = 1e18;

long long delivery(int n, int k, int l, int a[]) {
	vl tr(n+1);
	for (int i = n-1; i >= 0; i--) {
		tr[i] = tr[min(n, i+k)]+(l-a[i])+min(a[i], l-a[i]);
	}
	ll ans = LLINF;
	vl tl(n+1);
	for (int i = 0; i <= n; i++) {
		if (i<n) tl[i+1] = tl[max(0, i+1-k)]+a[i]+min(a[i], l-a[i]);
		ans = min(ans, tl[i]+tr[i]);
	}
	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