Submission #69095

#	Time	Username	Problem	Language	Result	Execution time	Memory
69095		TuGSGeReL	선물상자 (IOI15_boxes)	C++14	0 / 100	2 ms	376 KiB

boxes

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