# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
531013 | buidangnguyen05 | 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.
/* input
*/
#include<bits/stdc++.h>
using namespace std;
#define int long long
typedef long long ll;
const int N = 1e7 + 10;
int f[N], g[N];
int delivery(int n, int k, int l, int a[]) {
for (int i = 1; i <= n; ++i) f[i] = f[max(0LL, i - k)] + min(2 * a[i - 1], l);
for (int i = n; i; --i) g[i] = g[min(n + 1, i + k)] + min(2 * (l - a[i - 1]), l);
int res = 1e18;
for (int i = 1; i <= n; ++i) res = min(res, f[i] + g[i + 1]);
return res;
}