# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
68423 | zetapi | 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.
#include#incl "boxes.h"
#include "bits/stdc++.h"
using namespace std;
#define pb push_back
#define mp make_pair
#define ll long long
#define itr ::iterator
const int MAX=4e7;
ll N,K,L,cost[MAX],rev[MAX];
long long delivery(int N_,int K_, int L_,int P[])
{
N=N_;
K=K_;
L=L_;
for(int A=0;A<N;A++)
cost[A]=min(L,2*1ll*P[A])+(A-K<0?0:cost[A-K]);
for(int A=N-1;A>=0;A--)
rev[A]=min(L,2*1ll*(L-P[A]))+rev[A+K];
ll res=rev[0];
for(int A=0;A<N;A++)
res=min(res,cost[A]+rev[A+1]);
return res;
}