#include <bits/stdc++.h>
#define ll long long
#define sz(x) int(x.size())
#define forn(i,n) for(i=0; i<n; i++)
#define all(x) x.begin(),x.end()
#define pb push_back
#define mp make_pair
#define fr first
#define se second
using namespace std;
long long min_total_length(std::vector<int> r, std::vector<int> b) {
ll i, j;
vector<vector<ll>>dp(sz(r)+1,vector<ll>(sz(b)+1,0));
for(i=1; i<=sz(r); i++)
for(j=1; j<=sz(b); j++)
dp[i][j]=min(dp[i-1][j],min(dp[i][j-1],dp[i-1][j-1]))+abs(r[i-1]-b[j-1]);
return dp[sz(r)][sz(b)];
}
# | 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... |