# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
878808 | junha1282 | Wiring (IOI17_wiring) | C++14 | 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 "wiring.h"
#include <bits/stdc++.h>
using namespace std;
long long min_total_length(std::vector<int> s, std::vector<int> t) {
int n, m, si = 0, ti = 0;
cin>>n>>m;
vector<long long> s(n), t(m), ss(n+m+1), st(n+m+1), dp(n+m+1), c(2*n+2*m+2);
vector<pair<long long, int>> v;
v.push_back({-1, 0});
for (int i = 0; i < n; i++) {
cin>>s[i];
v.push_back({s[i], 0});
}
for (int i = 0; i < m; i++) {
cin>>t[i];
v.push_back({t[i], 1});
}
sort(v.begin(), v.end());
int x = n+m;
for (int i = 1; i <= n+m; i++) {
si = lower_bound(s.begin(), s.end(), v[i].first) - s.begin();
if(si == s.size()) si--;
if(si > 0 && s[si] > v[i].first) si--;
ti = lower_bound(t.begin(), t.end(), v[i].first) - t.begin();
if(ti == t.size()) ti--;
if(ti > 0 && t[ti] > v[i].first) ti--;
ss[i] = ss[i-1];
st[i] = st[i-1];
long long tmp = 0;
if(v[i].second == 1){
if(si < n-1) {
tmp = min(abs(s[si] - v[i].first), abs(s[si+1] - v[i].first));
} else {
tmp = abs(s[si] - v[i].first);
}
x++;
ss[i] += v[i].first;
} else {
if(ti < m-1) {
tmp = min(abs(t[ti] - v[i].first), abs(t[ti+1] - v[i].first));
} else {
tmp = abs(t[ti] - v[i].first);
}
x--;
st[i] += v[i].first;
}
if(c[x] != 0){
dp[i] = min(dp[i-1] + tmp, dp[c[x]] + abs(ss[i] - ss[c[x]] + st[c[x]] - st[i]));
} else {
dp[i] = dp[i-1] + tmp;
}
c[x] = i;
}
return dp[n+m];
}