Submission #96657

#	Time	Username	Problem	Language	Result	Execution time	Memory
96657		figter001	Boxes with souvenirs (IOI15_boxes)	C++14	100 / 100	493 ms	196080 KiB

boxes

#include "boxes.h"
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
const int maxn = 1e7+50;

ll pre[maxn],suf[maxn];

long long delivery(int n, int k, int l, int p[]) {
	for(int i=0;i<n;i++){
		pre[i] = 2ll*p[i];
		if(i >= k)pre[i] += pre[i-k];
	}
	for(int i=n-1;i>=0;i--){
		suf[i] = 2ll*(l - p[i]);
		if(i + k < n)suf[i] += suf[i+k];
	}
	ll ans = min(pre[n-1],suf[0]);
	if(k == n)ans = min(ans,l*1ll);
	for(int i=0;i<n-1;i++){
		if(i+k+1 < n)ans = min(ans,pre[i] + l + suf[i+k+1]);
		else ans = min(ans,pre[i] + l);
		ans = min(ans,pre[i] + suf[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