Submission #16518

#	Time	Username	Problem	Language	Result	Execution time	Memory
16518		ggoh	Boxes with souvenirs (IOI15_boxes)	C++98	100 / 100	635 ms	197232 KiB

boxes

#include<cstdio>
#include<algorithm>
long long a,i,mini,left[10000006],right[10000006];
long long min(long long XX,long long YY){return XX>YY?YY:XX;}
long long delivery(int N,int K,int L,int positions[])
{
	for(i=0;i<N;i++)
	{
		left[i]=positions[i]<=L/2?positions[i]*2:L;
		if(i+1>K)
		{
			left[i]+=left[i-K];
		}
	}
	for(i=N-1;i>=0;i--)
	{
		right[i]=(L-positions[i])<=L/2?(L-positions[i])*2:L;
		if(N-i>K)
		{
			right[i]+=right[i+K];
		}
	}
	mini=min(left[N-1],right[0]);
	for(i=1;i<N-1;i++)
	{
		mini=min(mini,left[i]+right[i+1]);
	}
	return mini;
}

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