# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
376496 | qwerasdfzxcl | 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 <bits/stdc++.h>
using namespace std;
typedef long long ll;
vector<int> a;
int n, k, l;
ll dp[10001000];
int dist(int x, int y){
return min(y-x, l-y+x);
}
int val(int x, int y){
return y-x+dist(0, x)+dist(0, y);
}
int main(){
scanf("%d %d %d", &n, &k, &l);
for (int i=0;i<n;i++){
int tmp;
scanf("%d", &tmp);
if (!tmp) continue;
a.push_back(tmp);
}
n = a.size();
int cnt=1;
dp[0]=dist(0, a[0])*2;
for (int i=1;i<n;i++){
//printf("dp[%d]: ", i);
if (i-k+1<=0) dp[i]=val(a[0], a[i]);
else dp[i]=dp[i-k]+val(a[i-k+1], a[i]);
for (int j=max(i-k+1, 0)+1;j<=i;j++) dp[i]=min(dp[i], dp[j-1]+val(a[j], a[i]));
//printf("%lld\n", dp[i]);
}
printf("%lld\n", dp[n-1]);
return 0;
}