Submission #70567

#	Time	Username	Problem	Language	Result	Execution time	Memory
70567		Sa1378	Boxes with souvenirs (IOI15_boxes)	C++17	100 / 100	425 ms	117864 KiB

boxes

#include "boxes.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define N ((int)1e7+10)

ll dp[N];

ll delivery(int n,int k, int l, int p[])
{
	int id=0;
	for(int i=0;i<n && p[i]<=l/2;i++,id++)
		dp[i]=2*p[i]+((i-k<0)?0:dp[i-k]);
	for(int i=n-1;i>=id;i--)
		dp[i]=2*(l-p[i])+((i+k>=n)?0:dp[i+k]);
	ll ans=min((ll)(n+k-1)/k*l,((id>0)?dp[id-1]:0)+dp[id]);
	int lft=max(0,id-k),rght=lft+k;
	while(lft<=id && rght<=n)
		ans=min(ans,dp[rght]+((lft>0)?dp[lft-1]:0)+l),
		lft++,rght++;
    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