#include <bits/stdc++.h>
#include "boxes.h"
// #include "grader.cpp"
using namespace std;
using ll = long long;
ll delivery(int n, int K, int L, int p[]) {
vector<ll> a(n + 2), b(n + 2);
for (int i = 1; i <= n; i++)
a[i] = (p[i - 1] << 1) + (K <= i ? a[i - K] : 0);
for (int i = n; i > 0; i--)
b[i] = (L - p[i - 1] << 1) + (i + K <= n ? b[i + K] : 0);
ll mn = LLONG_MAX;
for (int i = 0; i <= n; i++)
mn = min({mn, a[i] + b[i + 1], a[i] + L + (i + K + 1 <= n ? b[i + K + 1] : 0)});
return mn;
}
# | 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... |