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>
using namespace std;
long long delivery(int N, int K, int L, int p[]) {
if (K == 1) {
long long ans = 0;
for (int i = 0; i < N; ++i) ans += min(p[i] * 2, (L - p[i]) * 2);
return ans;
} else if (K == N) {
long long ans = min(L, min(2 * p[N - 1], 2 * (L - p[0])));
int* x = lower_bound(p, p + N, L / 2);
ans = min((int) ans, 2 * (*(x - 1)) + 2 * (L - *x));
return ans;
}
else return 0;
}
# | 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... |