# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1217032 | takoshanava | Boxes with souvenirs (IOI15_boxes) | C++20 | 0 ms | 0 KiB |
#include "boxes.h"
#include <bits/stdc++.h>
#define int long long
using namespace std;
const int MAX = 10000005;
int dp1[MAX], dp2[MAX];
int delivery(int N, int K, int L, int pos[]) {
for(int i = 0; i < N; i++){
dp1[i] = dp1[max(0LL, i - K)] + pos[i] + min(pos[i], (L - pos[i]));
}
for(int i = N - 1; i >= 0; i--){
dp2[i] = dp2[min(n, i + K)] + (L - pos[i]) + min(pos[i], (L - pos[i]));
}
int ans = 1e18;
for(int i = 0; i <= N - 1; i++){
ans = min(ans, dp1[i] + dp2[i + 1]);
}
return ans;
}