Submission #18492

#	Time	Username	Problem	Language	Result	Execution time	Memory
18492		eaststar	Boxes with souvenirs (IOI15_boxes)	C++14	100 / 100	710 ms	196172 KiB

boxes

#include "boxes.h"
#include <algorithm>
using namespace std;
long long D[10000010],E[10000010],ans;
long long delivery(int n,int k,int l,int a[]){
    int i;
    sort(a,a+n);
    for(i=0;i<n;++i)D[i]=(i<k?0:D[i-k])+min(a[i]*2,l);
    for(;i--;)E[i]=(i<n-k?E[i+k]:0)+min((l-a[i])*2,l);
    ans=E[0];
    for(i=0;i<n;++i)ans=min(ans,D[i]+E[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