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 <algorithm>
#include <iostream>
using namespace std;
long long delivery(int N, int K, int L, int p[])
{
sort(p,p+N);
long long z=1e18;
for (int i=0;i<=N;i++)
{
int j=0,cp=K;
long long cur=0;
int pre=0;
while (j<i)
{
if (cp==0)
{
cur+=2*min(L-pre,pre);
cp=K;
}
cur+=p[j]-pre;
pre=p[j];
j++;
cp--;
}
if (j>0)
{
cur+=min(p[j-1],L-p[j-1]);
}
j=N-1;
cp=K;
pre=L;
while (j>=i)
{
if (cp==0)
{
cur+=2*min(L-pre,pre);
cp=K;
}
cur+=pre-p[j];
pre=p[j];
j--;
cp--;
}
cur+=min(p[i],L-p[i]);
z=min(z,cur);
}
return z;
}
# | 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... |