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"
using namespace std;
using ll = long long;
ll delivery(int N, int K, int L, int pos[]) {
sort(pos, pos + N);
vector<ll> left(N, 0), right(N, 0);
for(int i=0; i<N; i++)
left[i] = pos[i] + min(pos[i], L - pos[i]) + (i < K ? 0 : left[i-K]);
for(int i=N-1; i>=0; i--)
right[i] = L - pos[i] + min(pos[i], L - pos[i]) + (N - 1 < K + i ? 0 : right[i+K]);
ll ans = min(left[N-1], right[0]);
for(int i=0; i<N-1; i++)
ans = min(ans, left[i] + right[i+1]);
return ans;
}
# | 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... |