# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
444575 | osmanallazov | 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>
#define ll long long
long long delivery(int N, int K, int L, int p[]) {
ll res=0;
if(K==1){
for(int i=0;i<N;i++){
if(p[i]==0){
res+=0;
}
else if(p[i]<=L/2){
res+=(p[i]*2);
}
else{
res+=((L-p[i])*2);
}
}
}
else if(K==N){
res=L;
sort(p,p+N);
for(int i=0;i<N-1;i++){
res=min(res,(p[i]+L-p[i+1])*2);
}
res=min(res,L);
}
return res;
}