# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1053902 | aaaaaarroz | Wiring (IOI17_wiring) | C++17 | 0 ms | 0 KiB |
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 <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
using namespace std;
int64_t min_total_length(vector<int>& red, vector<int>& blue) {
int n = red.size();
int m = blue.size();
// Crear una matriz DP de tamaño (n+1) x (m+1)
vector<vector<int64_t>> dp(n + 1, vector<int64_t>(m + 1, INT64_MAX));
// Caso base: Si no hay puntos, la longitud es 0
dp[0][0] = 0;
// Llenar la tabla DP
for (int i = 0; i <= n; ++i) {
for (int j = 0; j <= m; ++j) {
if (i > 0 && j > 0) {
dp[i][j] = min(dp[i][j], dp[i-1][j-1] + abs(red[i-1] - blue[j-1]));
}
if (i > 0) {
dp[i][j] = min(dp[i][j], dp[i-1][j]);
}
if (j > 0) {
dp[i][j] = min(dp[i][j], dp[i][j-1]);
}
}
}
// El resultado estará en dp[n][m]
return dp[n][m];
}