Submission #287879

#	Time	Username	Problem	Language	Result	Execution time	Memory
287879		Bill_00	Boxes with souvenirs (IOI15_boxes)	C++14	100 / 100	862 ms	289916 KiB

boxes

#include "boxes.h"
#include <bits/stdc++.h>
using namespace std;
long long pre[10000001],suf[10000001],p[10000001];
long long delivery(int n, int k, int l, int o[]){
	for(int i=0;i<n;i++){
		p[i+1]=o[i];
	}
	sort(p+1,p+n+1);
	for(int i=1;i<=k;i++){
		pre[i]=2*p[i];
	}
	pre[0]=0,suf[n+1]=0;
	for(int i=k+1;i<=n;i++){
		pre[i]=pre[i-k]+2*p[i];
	}
	for(int i=1;i<=k;i++){
		suf[n+1-i]=2*(l-p[n+1-i]);
	}
	for(int i=k+1;i<=n;i++){
		suf[n+1-i]=suf[n+1-i+k]+2*(l-p[n+1-i]);
	}
	long long ans=1e18;
	for(int i=0;i<=n;i++){
		ans=min(ans,pre[i]+suf[i+1]);
	}
	for(int i=0;i<=n-k;i++){
		ans=min(ans,pre[i]+suf[i+k+1]+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