This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "boxes.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
long long delivery(int N, int K, int L, int p[]) {
ll res = 1ll*((N+K-1)/K)*L;
ll lmov[N],rmov[N];
for(ll i=0;i<N;i++)
{
lmov[i] = p[i];
ll left = K-1;
for(ll j=i-1;j>=0;j--)
{
lmov[i]+=p[j+1]-p[j];
if(left) left--;
else
{
lmov[i]+=p[j]*2;
left = K-1;
}
}
lmov[i]+=p[0];
}
for(ll i=N-1;i>=0;i--)
{
rmov[i] = (L-p[i]);
ll left = K-1;
for(ll j=i+1;j<N;j++)
{
rmov[i]+=p[j]-p[j-1];
if(left) left--;
else
{
rmov[i]+=(L-p[j])*2;
left = K-1;
}
}
rmov[i]+=(L-p[N-1]);
}
//cout<<"lmov: "; for(ll i=0;i<N;i++) cout<<lmov[i]<<" "; cout<<"\n";
//cout<<"rmov: "; for(ll i=0;i<N;i++) cout<<rmov[i]<<" "; cout<<"\n";
res = min(res,lmov[N-1]);
res = min(res,rmov[0]);
for(ll l=0;l<N;l++)
{
for(ll r=l+1;r<N;r++)
{
ll left = r-l-1;
res = min(res, lmov[l]+rmov[r]+1ll*((left+K-1)/K)*L);
}
}
return res;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |