# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
699127 | epicci23 | 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 "boxes.h"
long long delivery(int N, int K, int L, int p[]) {
long long dp[N+1];
for(int i=1;i<=K;i++) dp[i]=2*min(L-p[i],p[i]);
for(int i=K+1;i<=N;i++) dp[i]=dp[i-K] + min(p[i]+min(p[i],L-p[i]),L-p[i-K+1]+min(L-p[i-K+1],p[i-K+1]));
return dp[N];
}