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