# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
618862 | A_D | Boxes with souvenirs (IOI15_boxes) | C++14 | 0 ms | 0 KiB |
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>
const int N=1e7+10;
long long pre[N];
long long suf[N];
long long delivery(int N, int K, int L, int p[]) {
sort(p,p+N);
long long ans=1e18;
long long me=0,cur=0,lst=0;
for(int i=0;i<N;i++){
long long h=p[i];
me+=h-lst;
cur++;
pre[i]=me+min(h,N-h);
if(cur==k){
me+=min(h,N-h);
cur=0;
me+=h;
}
lst=p[i];
}
ans=pre[N-1];
me=0,cur=0,lst=0;
for(int i=N-1;i>=0;i--){
long long h=p[i];
me+=abs(h-lst);
cur++;
suf[i]=me+min(h,N-h);
if(cur==k){
me+=min(h,N-h);
cur=0;
me+=N-h;
}
lst=p[i];
}
return ans;
}