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)
{
ll ans = 0;
int n = r.size(), m = b.size();
ll dp[n][m], inf = 1e18;
for(int i = 0; i <= n; i ++)
for(int j = 0; j <= m; j ++)
dp[i][j] = inf;
dp[0][0] = 0;
for(int i = 0; i < n; i ++)
for(int j = 0; j < m; j ++)
dp[i + 1][j + 1] = abs(r[i] - b[j]) + min(min(dp[i][j - 1], dp[i - 1][j]), dp[i - 1][j - 1]);
ans = dp[n][m];
return ans;
}
# | 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... |