Submission #531020

#	Time	Username	Problem	Language	Result	Execution time	Memory
531020		buidangnguyen05	Boxes with souvenirs (IOI15_boxes)	C++14	100 / 100	471 ms	198072 KiB

boxes

/* input
 
*/
 
#include "boxes.h"
#include<bits/stdc++.h>
using namespace std;
 
typedef long long ll;
const int N = 1e7 + 10;
ll f[N], g[N];
 
ll delivery(int n, int k, int l, int a[]) {
	for (int i = 1; i <= n; ++i) f[i] = f[max(0, i - k)] + min(2 * a[i - 1], l);
	ll res = 1e18;
	for (int i = n; i; --i) {
		g[i] = g[min(n + 1, i + k)] + min(2 * (l - a[i - 1]), l);
		res = min(res, f[i - 1] + g[i]);
	}
 
	return min(res, f[n]);
}

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