Submission #362925

#	Time	Username	Problem	Language	Result	Execution time	Memory
362925		David_M	선물상자 (IOI15_boxes)	C++14	0 / 100	1 ms	512 KiB

boxes

#include "boxes.h"
#include<bits/stdc++.h>
using namespace std;
long long delivery(int n, int k, int L, int p[]) {
	int Ans=1e9, l[n], r[n];
	memset (l, 0, sizeof(l));
	memset (r, 0, sizeof(r));
	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, min(l[i]+r[n-i], l[i]+r[max(n-i-k, 0)]+L));
	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