# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
489355 | SlavicG | Boxes with souvenirs (IOI15_boxes) | C++17 | 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"
#include "boxes.h"
using namespace std;
#define ll long long
#define forn(i,n) for(int i=0;i<n;i++)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(),v.rend()
#define pb push_back
#define sz(a) (int)a.size()
int delievery(int n, int k, int l, int positions[]){
vector<ll> dpl(n + 5, 1e18), dpr(n + 5, 1e18);
dpl[0] = 0;
for(int i = 1;i <= n; ++i){
dpl[i] = dpl[max(0, i - k)] + 2 * positions[i - 1];
}
dpr[n + 1] = 0;
for(int i = n;i >= 1; --i){
dpr[i] = dpr[min(n + 1, i + k)] + 2 * (l - positions[i - 1]);
}
ll ans = 1e18;
for(int i = 0;i <= n; ++i){
ans = min(ans, dpl[i] + dpr[i]);
ans = min(ans, dpl[i] + dpr[min(n + 1, i + 1 + k)] + l);
}
return ans;
}