# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
71401 | Kmcode | Wiring (IOI17_wiring) | 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 "books.h"
using namespace std;
#define MAX 100002
int n;
long long int dp[MAX][60];
long long min_total_length(std::vector<long long int> r, std::vector<long long int> b) {
for(int i=0;i<r.size();i++){
for(int j=0;j<60;j++){
dp[i][j]=LLONG_MAX;
}
}
dp[0][20]=abs(r[0]-b[0]);
for(int i=0;i<r.size();i++){
for(int j1=0;j1<50;j1++){
int j=i+j1-20;
if(j<0||j>=b.size())continue;
if(dp[i][j1]==LLONG_MAX)continue;
if(i+1<r.size()){
int base=i+1-20;
dp[i+1][j-base]=min(dp[i+1][j-base],dp[i][j1]+abs(r[i+1]-b[j]));
}
if(j+1<b.size()){
int base=i-20;
dp[i][j+1-base]=min(dp[i][j+1-base],dp[i][j1]+abs(r[i]-b[j+1]));
}
if(i+1<r.size()&&j+1<b.size()){
int base=i+1-20;
dp[i+1][j+1-base]=min(dp[i+1][j+1-base],dp[i][j1]+abs(r[i+1]-b[j+1]));
}
}
}
int t=r.size()-1;
return dp[r.size()-1][20];
}