Submission #393454

#	Time	Username	Problem	Language	Result	Execution time	Memory
393454		wmrmr	Boxes with souvenirs (IOI15_boxes)	C++17	100 / 100	578 ms	196784 KiB

boxes

#include <boxes.h>
#include <bits/stdc++.h>
#define lli long long int
using namespace std;
const int MAX = 1e7+1;
lli l[MAX], r[MAX];
 
lli delivery(int n, int k, int MOD, int p[])
{
	for(int i=0;i<n;i++)
	{
		l[i] = 2*p[i];
		if(k<=i) l[i] += l[i-k]; 
	}
	for(int i=n-1;i>=0;i--)
	{
		lli rev = MOD-p[i];
		r[i] = 2*rev;
		if(i+k<n) r[i] += r[i+k];
	}
	lli ret = min( r[0] , l[n-1] );
	for(int i=0;i<n-1;i++) ret = min( ret , l[i] + r[i+1] );
	lli cyc = MOD;
	if(k>=n) ret = min( ret , cyc );
	else
	{
		ret = min( ret , r[k] + cyc );
		ret = min( ret , l[n-k-1] + cyc );
	}
	for(int i=0;i+k+1<n;i++) ret = min( ret , l[i] + r[i+k+1] + cyc );
	return ret;
}

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