# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
574966 | stevancv | 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 <bits/stdc++.h>
#define ll long long
#define ld long double
#define sp ' '
#define en '\n'
#define smin(a, b) a = min(a, b)
#define smax(a, b) a = max(a, b)
using namespace std;
ll delivery(int N, int K, int D, int pos[]) {
ll n = N; ll k = K; ll d = D;
vector<ll> a(n + 2);
for (int i = 1; i <= n; i++) a[i] = pos[i - 1];
a[n + 1] = d;
vector<ll> p(n + 2), s(n + 2);
for (int i = 0; i <= n + 1; i++) {
p[i] = 2 * a[i];
s[i] = 2 * (d - a[i]);
}
for (int i = k; i <= n + 1; i++) p[i] += p[i - k];
for (int i = n - k + 1; i >= 0; i--) s[i] += s[i + k];
ll ans = 1e18;
for (int l = 1; l <= n; l++) {
for (int r = l - 1; r <= n; r++) {
ll kolko = r - l + 1;
kolko = (kolko + k - 1) / k;
smin(ans, p[l - 1] + s[r + 1] + kolko * d);
}
}
return ans;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n, k, l;
cin >> n >> k >> l;
int pos[n];
for (int i = 0; i < n; i++) cin >> pos[i];
cout << delivery(n, k, l, pos) << en;
return 0;
}