Submission #362927

#	Time	Username	Problem	Language	Result	Execution time	Memory
362927		David_M	Boxes with souvenirs (IOI15_boxes)	C++14	100 / 100	562 ms	241220 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=1e18, l[n+1], r[n+1];
	memset (l, 0, sizeof(l));
	memset (r, 0, sizeof(r));
	for (int i=1; i<=n; i++)r[i]=r[max(i-k,0)]+p[i-1]*2,l[i]=l[max(i-k,0)]+(L-p[n-i])*2;
	for (int i=0; i<=n; i++)Ans=min(Ans, min(l[i]+r[n-i], l[i]+r[max(n-i-k, 0)]+L));
	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