# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
521016 | ColourAttila | Boxes with souvenirs (IOI15_boxes) | C++17 | 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>
using namespace std;
long long delivery(int N, int K, int L, int p[]) {
if(K == 1) {
long long ret = 0;
for(int i = 0; i < N; i++) {
ret += min(p[i], L-p[i]) * 2;
}
return ret;
}
sort(p, p+N);
long long ret = min(L, min(p[n-1]*2ll, (L-p[0])*2ll));
for(int i = 0; i < N-1; i++) {
ret = min(ret, (p[i] + L - p[i+1])*2ll);
}
return ret;
}