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>
using namespace std;
typedef long long ll;
ll min_total_length(vector<int>r, vector<int>b) {
int n=r.size();
int m=b.size();
vector<vector<ll>>dp(n+1,vector<ll>(m+1,LLONG_MAX));
dp[0][0]=0;
for(int i=0;i<=n;i++){
for(int j=0;j<=m;j++){
if(i>0&&j>0){
dp[i][j]=min(dp[i][j],dp[i-1][j-1]+abs(r[i-1]-b[j-1]));
}
if(i>0&&j==0){
dp[i][j]=min(dp[i][j],dp[i-1][j]);
}
if(j>0&&i==0){
dp[i][j]=min(dp[i][j],dp[i][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... |