# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
284521 | IOrtroiii | Boxes with souvenirs (IOI15_boxes) | C++14 | 0 ms | 0 KiB |
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 "boxes.h"
#include <bits/stdc++.h>
using namespace std;
long long delivery(int N, int K, int L, int p[]) {
vector<long long> pref(N);
vector<long long> suff(N);
for (int i = 0; i < N; ++i) {
pref[i] = 2 * p[i];
if (i >= K) pref[i] += pref[i - K];
}
for (int i = N - 1; i >= 0; --i) {
suff[i] = 2 * (L - p[i]);
if (i + K < N) suff[i] += suff[i + K];
}
long long ans = min(pref[N - 1], suff[0]);
for (int i = 0; i + 1 < N; ++i) ans = min(ans, pref[i] + suff[i + 1]);
for (int i = 0; i + 1 + K < N; ++i) ans = min(ans, pref[i] + suff[i + 1 + K] + L);
return ans;
}
int main() {
int p[] = {1, 2, 5};
cout << delivery(3, 2, 8, p);
}