#include "wiring.h"
#include <algorithm>
#include <vector>
using namespace std;
long long min_total_length(vector<int> r, vector<int> b) {
int n = r.size(), m = b.size();
vector<vector<long long>> dp(n, vector<long long>(m));
dp[0][0] = abs(r[0] - b[0]);
for (int i = 1; i < n; i++) {
dp[i][0] = dp[i - 1][0] + abs(r[i] - b[0]);
}
for (int j = 1; j < m; j++) {
dp[0][j] = dp[0][j - 1] + abs(b[j] - r[0]);
}
for (int i = 1; i < n; i++) {
for (int j = 1; j < m; j++) {
dp[i][j] = min(dp[i - 1][j - 1], min(dp[i - 1][j], dp[i][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... |