# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1061002 | vjudge1 | Wiring (IOI17_wiring) | C++17 | 164 ms | 262144 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 <bits/stdc++.h>
#include "wiring.h"
using namespace std;
typedef long long ll;
int get_closest(int x, vector<int> &vec){
int lb = lower_bound(vec.begin(), vec.end(), x) - vec.begin();
int res = 1e9 + 10;
if (lb < vec.size())
res = min(res, abs(x - vec[lb]));
lb--;
if (lb >= 0)
res = min(res, abs(x - vec[lb]));
return res;
}
ll min_total_length(vector<int> a, vector<int> b) {
int n = a.size(), m = b.size();
int p = 0, q = 0;
ll dp[n + 1][m + 1];
memset(dp, 31, sizeof dp);
dp[0][0] = 0;
for (int i = 0; i <= n; i ++){
for (int j = 0; j <= m; j ++){
if (i == 0 and j == 0) continue;
if (j != 0)
dp[i][j] = min(dp[i][j], dp[i][j - 1] + get_closest(b[j - 1], a));
if (i != 0)
dp[i][j] = min(dp[i][j], dp[i - 1][j] + get_closest(a[i - 1], b));
if (i != 0 and j != 0)
dp[i][j] = min(dp[i][j], dp[i - 1][j - 1] + abs(a[i - 1] - b[j - 1]));
}
}
return dp[n][m];
}
Compilation message (stderr)
# | 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... |