# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
497875 | kevin | Wiring (IOI17_wiring) | C++17 | 61 ms | 9056 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>
using namespace std;
#define ll long long
#define all(x) x.begin(), x.end()
#define f first
#define s second
#define ca(v) for(auto i:v) cout<<i<<" ";
#define nl cout<<"\n"
const int MAXN = 5e5 + 5;
ll min_total_length(vector<int> a, vector<int> b){
vector<pair<ll, int>> ar;
for(int i:a) ar.push_back({(ll)i, 0});
for(int i:b) ar.push_back({(ll)i, 1});
sort(ar.begin(), ar.end());
int p = 0;
int pv = -1;
vector<ll> val[2];
while(p < (int)ar.size()){
vector<ll> v;
ll x = ar[p].f;
v.push_back(x);
while(p < (int)ar.size() - 1 && ar[p].s == ar[p+1].s) v.push_back(ar[++p].f);
p++;
ll iv = (p == (int)ar.size()?0:ar[p].f-ar[p-1].f);
if(pv == -1){
if(p == (int)ar.size()) return 0;
val[0] = val[1] = vector<ll>(v.size() + 1, 1e18);
ll sm = 0;
for(ll i:v) sm += v.back() - i;
val[0][v.size()] = val[1][v.size()] = sm;
}
else{
vector<ll> nxt(v.size() + 1);
ll lsm = 0;
ll rsm = 0;
for(int i=0; i<(int)v.size(); i++) rsm += v.back() - v[i];
nxt[v.size()] = val[0][0] + rsm;
for(int i=1; i<=(int)v.size(); i++){
lsm += v[i-1] - v[0];
rsm -= v.back() - v[i-1];
int id = min(i, (int)val[0].size()-1);
nxt[v.size()-i] = min(val[0][id] + (ll)(i) * (x-pv), (ll)(i<(int)val[1].size()?val[1][i]:1e18)) + lsm + rsm;
}
val[0] = nxt;
nxt.clear();
}
val[1] = val[0];
pv = ar[p-1].f;
for(int i=0; i<val[0].size(); i++) val[1][i] += i * iv;
for(int i=1; i<(int)val[0].size(); i++){
val[0][i] = min(val[0][i], val[0][i-1]);
val[1][val[0].size()-1-i] = min(val[1][val[0].size()-i], val[1][val[0].size()-1-i]);
}
if(p == ar.size()) return val[0][0];
}
}
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... |