Submission #362929

#	Time	Username	Problem	Language	Result	Execution time	Memory
362929		David_M	Boxes with souvenirs (IOI15_boxes)	C++14	100 / 100	530 ms	196204 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];l[0]=r[0]=0;
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,l[i]+min(r[n-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