# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
134531 | 20160161simone | 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"
#define M 10000010
#define inf 0x3f3f3f
int mi[M];
long long delivery(int N, int K, int L, int p[]) {
for(int i=1;i<=N;i++){
mi[i]=min(abs(L-p[i]),abs(p[i]))*2;
}
sort(mi+1,mi+1+N);
int ans=0,val=0,k=0;
for(int i=1;i<=N;i++)
{
k++;
val=max(mi[i],val);
if(k==K)
{
ans+=val;
val=0;
k=0;
}
}
ans+=val;
return ans;
}