# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
839668 | PagodePaiva | 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"
#define LL long long
#define N 10000010
using namespace std;
LL pref[N], suf[N];
LL delivery(int n, int k, int L, int p[]){
pref[0] = 2*p[0];
for(int i = 1;i < n;i++){
pref[i] = 2*p[i] + (i >= k ? pref[i-k]:0);
}
for(int i = n-1;i >= 0;i--){
suf[i] = 2*p[i] + (n-1 - i >= k ? suf[i+k]:0);
}
LL res = 1e16;
for(int i = 0;i < n;i++){
res = min(res, pref[i] + suf[i+1]);
}
res = min(res, suf[0]);
for(int i = 0;i < n;i++){
res = min(res, (i > 0 ? pref[i-1] : 0) + (i+k < n+5 ? suf[i+K] : 0) + L);
}
return res;
}