Submission #412938

#	Time	Username	Problem	Language	Result	Execution time	Memory
412938		ScarletS	Boxes with souvenirs (IOI15_boxes)	C++17	100 / 100	526 ms	197756 KiB

boxes

#include <bits/stdc++.h>
#define ll long long
using namespace std;

ll delivery(int n, int k, int l, int p[])
{
	ll ans=1e18, L[n+3], R[n+3];
	L[0]=0;R[n+1]=0;R[n+2]=0;
	for (int i=0;i<n;++i)
		L[i+1]=L[max(0,i+1-k)]+p[i]*2;
	for (int i=n-1;i>=0;--i)
	{
		R[i+1]=R[min(n+1,i+1+k)]+(l-p[i])*2;
		ans=min(ans,L[i]+R[i+1]);
	}
	ans=min(ans,L[n]);
	for (int i=0;i+k<=n;++i)
		ans=min(ans,L[i]+R[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