# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
376527 | 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>
#include "boxes.h"
using namespace std;
typedef long long ll;
vector<int> a;
int n, k, l;
ll dp[10001000], dp2[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);
}
ll delivery(int N, int K, int L, int pos[]){
n=N, k=K, l=L;
for (int i=0;i<n;i++){
int tmp;
tmp = pos[i];
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]);
//printf("%lld\n", dp[i]);
}
dp2[n-1]=dist(0, a[n-1])*2;
for (int i=n-2;i>=0;i--){
if (i+k-1>=n-1) dp2[i]=val(a[i], a[n-1]);
else dp2[i]=dp2[i+k]+val(a[i], a[i+k-1]);
}
ll ans=min(dp[n-1], dp2[n-1]);
for (int i=1;i<n-1;i++) ans = min(ans, dp[i]+dp2[i+1]);
return ans;