#include "boxes.h"
#include <bits/stdc++.h>
using namespace std;
long long delivery(int N, int K, int L, int pos[]) {
vector<int> a(pos, pos + N);
sort(a.begin(), a.end());
vector<long long> dp1(N + 1), dp2(N + 1);
for (int i = 1; i <= N; i++) {
if (i >= K)
dp1[i] = dp1[i - K] + 2LL * a[i - 1];
else
dp1[i] = 2LL * a[i - 1];
}
for (int i = 1; i <= N; i++) {
if (i >= K)
dp2[i] = dp2[i - K] + 2LL * (L - a[N - i]);
else
dp2[i] = 2LL * (L - a[N - i]);
}
long long ans = LLONG_MAX;
for (int i = 0; i <= N; i++) {
ans = min(ans, dp1[i] + dp2[N - i]);
}
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... |