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 <bits/stdc++.h>
#include "boxes.h"
#define see(x) cerr<<#x<<"="<<"\n";
using namespace std;
long long delivery(int N, int K, int L, int p[]) {
if (K == 1) {
int ans = 0;
for (int i = 0; i < N; i ++) {
if (p[i] <= L / 2) {
ans += 2 * p[i];
}
else {
ans += 2 * (L - p[i]);
}
}
return ans;
}
if (K == N) {
long long ans = L;
long long pos1 = 0, pos2 = L;
for (int i = 0; i < N; i ++) {
if (p[i] <= L / 2) pos1 = p[i];
else if (pos2 == L) pos2 = p[i];
}
ans = min(ans, 2 * pos1 + 2 * (L - pos2));
return ans;
}
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... |