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 "wiring.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,int> ii;
const ll MAX=1e12;
const int MAX_N=210;
int n,m;
ll dp[MAX_N][MAX_N];
long long min_total_length(std::vector<int> r, std::vector<int> b) {
n=r.size(); m=b.size();
dp[0][0]=abs(r[0]-b[0]);
for(int i=0;i<n;i++){
for(int j=0;j<m;j++){
if(i==j && i==0) continue;
ll mi=MAX;
if(i!=0 && j!=0) mi=min(mi,dp[i-1][j-1]);
if(i!=0) mi=min(mi,dp[i-1][j]);
if(j!=0) mi=min(mi,dp[i][j-1]);
dp[i][j]=mi+abs(r[i]-b[j]);
}
}
return dp[n-1][m-1];
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |