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;
//#define int long long
#define RE(i,n) for(int i = 1;i <= n;i++)
const int N = 201;
long long dp[N][N];
int n,m;
long long min_total_length(vector<int> r, vector<int> b) {
n = r.size();
m = b.size();
dp[0][0] = 0;
RE(i,n){
RE(j,m){
dp[i][j] = dp[i-1][j-1]+abs(r[i-1]-b[j-1]);
if(i > 1)dp[i][j] = min(dp[i][j],dp[i-1][j]+abs(r[i-1]-b[j-1]));
if(j > 1)dp[i][j] = min(dp[i][j],dp[i][j-1]+abs(r[i-1]-b[j-1]));
}
}
return dp[n][m];
}
# | 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... |