# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
760836 | Ahmed57 | 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>
using namespace std;
int arr[1000001];int dp[1000001],l,k,n;
long long solve(int i){
if(i>=n){
return 0;
}
if(dp[i]!=-1)return dp[i];
long long c1 = 1e18;
if(i==0){
for(int e = 1;e<=k;e++){
c1 = min(c1,solve(i+k)+l);
c1 = min(c1,solve(i+k)+2*arr[min(n-1,i+k-1)]);
c1 = min(c1,solve(i+k)+2*(l-arr[i]));
}
}
c1 = min(c1,solve(i+k)+l);
c1 = min(c1,solve(i+k)+2*arr[min(n-1,i+k-1)]);
c1 = min(c1,solve(i+k)+2*(l-arr[i]));
return dp[i] = c1;
}
long long delivery(int N, int K, int L,vector<int> a) {
for(int i = 0;i<N;i++){
dp[i] = -1 , arr[i] = a[i];
}
l = L;k = K;n = N;
return solve(0);
}/*
int main(){
cout<<delivery(3,2,8,{1,2,5});
}
*/