Submission #16533

#	Time	Username	Problem	Language	Result	Execution time	Memory
16533		gs13068	Boxes with souvenirs (IOI15_boxes)	C++98	100 / 100	492 ms	196104 KiB

boxes

#include <algorithm>

long long L[11111111];
long long R[11111111];

long long delivery(int n,int k,int l,int a[])
{
	long long r;
    int i;
    for(i=1;i<=n;i++)
	{
		L[i]=std::min(a[i-1]<<1,l);
        if(i>k)L[i]+=L[i-k];
	}
	r=L[n];
    for(i=n-1;i>=0;i--)
	{
		R[i]=std::min((l-a[i])<<1,l);
		if(i+k<n)R[i]+=R[i+k];
		r=std::min(r,L[i]+R[i]);
	}
	return r;
}

• Subtask 1: 10 / 10
• Subtask 2: 10 / 10
• Subtask 3: 15 / 15
• Subtask 4: 15 / 15
• Subtask 5: 20 / 20
• Subtask 6: 30 / 30