#include "wiring.h"
#include<bits/stdc++.h>
using namespace std;
#define int long long
const int INF = 1e18;
int dp[200005];
int tole[200005];
long long min_total_length(std::vector<int32_t> r, std::vector<int32_t> b)
{
vector<pair<int,int>> v;
for(int x:r)
v.push_back({x,0});
for(int x:b)
v.push_back({x,1});
v.push_back({-1,-1});
sort(v.begin(),v.end());
int ult[2] = {0,0};
for(int i=1;i<v.size();i++)
{
ult[v[i].second] = i;
tole[i] = ult[1-v[i].second];
}
for(int i=(int)v.size()-1;i<v.size();i++)
{
dp[i]=INF;
int ri = tole[i];
if(ri==0)
continue;
int le = tole[ri]+1;
for(int j=le;j<=le;j++)
{
int aux=0;
for(int u=ri+1;u<=i;u++)
aux += v[u].first - v[ri+1].first;
for(int u=j;u<=ri;u++)
aux += v[ri].first - v[u].first;
aux += max(ri-j+1, i-ri) * (v[ri+1].first - v[ri].first);
dp[i] = min(dp[i], aux + dp[j-1]);
}
}
return dp[(int)v.size()-1];
}
/*
*/
# | 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... |