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;
const int MAXN=200+5;
typedef long long ll;
ll dp[MAXN][MAXN];
long long min_total_length(std::vector<int> r, std::vector<int> b){
int n=r.size();
int m=b.size();
dp[0][0]=abs(r[0]-b[0]);
for(int i=1;i<m;i++)dp[0][i]=dp[0][i-1]+abs(r[0]-b[i]);
for(int i=1;i<n;i++)dp[i][0]=dp[i-1][0]+abs(b[0]-r[i]);
for(int i=1;i<n;i++)
for(int j=1;j<m;j++){
dp[i][j]=min(dp[i][j-1],min(dp[i-1][j],dp[i-1][j-1]))+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... |