Submission #716756

#	Time	Username	Problem	Language	Result	Execution time	Memory
716756		Baytoro	Boxes with souvenirs (IOI15_boxes)	C++17	0 / 100	1 ms	212 KiB

boxes

#include "boxes.h"
//#include "grader.cpp"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
long long delivery(int n, int k, int L, int p[]) {
	ll ans=1e18;
	vector<ll> pref(n+1),suf(n+1);
	for(int i=0;i<n;i++){
		if(i<k) pref[i+1]=0;
		else pref[i+1]=pref[i+1-k]+p[i]*2;
		if(i<k) suf[i+1]=(L-p[n-i-1])*2;
		else suf[i+1]=suf[i+1-k]+(L-p[n-i-1]*2);
	}
	for(int i=0;i<=n;i++){
		for(int j=i;j<=n;j+=k){
			ll x=(ll)(j-i)/k*L;
			x+=pref[i];
			x+=suf[n-j];
			ans=min(ans,x);
		}
	}
	return ans;
}

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