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