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>
#define ll long long
using namespace std;
ll cost(ll x, ll y)
{
return abs(x - y);
}
ll dp[4005][4005];
long long min_total_length(vector<int> r, vector<int> b)
{
int n = r.size(), m = b.size();
r.insert(r.begin(), 0);
b.insert(b.begin(), 0);
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++)
dp[i][j] = min({dp[i - 1][j - 1], dp[i - 1][j], dp[i][j - 1]}) + cost(r[i], b[j]);
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... |