#include "wiring.h" #include <bits/stdc++.h> #define fst first #define snd second #define pb push_back #define SZ(x) (long long)x.size() #define ALL(x) x.begin(),x.end() #define forn(i,a,b) for(int i = a; i<b;i++) #define mset(a,v) memset(a,v,sizeof(a)) #ifdef D #define debug(x) cout<<" (debug) "<<x #else #define debug(x) //nada #endif using namespace std; typedef long long ll; const int MAXN = 200000+5; #define INF ((ll)10000000000000000) ll dp[MAXN]; ll n,m; ll mypos[MAXN]; ll mycolor[MAXN]; ll myblock[MAXN]; ll myposblock[MAXN]; vector<vector<ll>> block; long long min_total_length(std::vector<int> r, std::vector<int> b) { mset(dp,-1); ll cnt = 1; ll last = -1; sort(ALL(r)); sort(ALL(b)); reverse(ALL(r)); reverse(ALL(b)); while(!r.empty() || !b.empty()){ if(b.empty() || (!r.empty() &&r.back()<b.back())){ if(last!=0){ block.pb({}); last=0; } mypos[cnt]=r.back(); mycolor[cnt]=0; myblock[cnt]=SZ(block)-1; myposblock[cnt]=SZ(block.back()); block.back().pb(cnt); //block.back().pb(r.back()); r.pop_back(); cnt++; }else{ if(last!=1){ block.pb({}); last=1; } mypos[cnt]=b.back(); mycolor[cnt]=0; myblock[cnt]=SZ(block)-1; myposblock[cnt]=SZ(block.back()); block.back().pb(cnt); //block.back().pb(b.back()); b.pop_back(); cnt++; } } forn(i,0,SZ(block)){ debug("BLOCK "<<i<<'\n'); for(auto j:block[i]) debug(" "<<j); debug('\n'); } vector<vector<ll>> pre(SZ(block)); vector<vector<ll>> suf(SZ(block)); forn(i,0,SZ(block)){ pre[i].clear(); pre[i].resize(SZ(block[i])); forn(j,0,SZ(block[i])){ pre[i][j]=mypos[block[i][j]]-mypos[block[i][0]]; if(j>0) pre[i][j]+=pre[i][j-1]; } suf[i].clear(); suf[i].resize(SZ(block[i])); for(int j = SZ(block[i])-1; j>=0; j--){ suf[i][j]=mypos[block[i].back()]-mypos[block[i][j]]; if(j+1<SZ(block[i])) suf[i][j]+=suf[i][j+1]; } } forn(i,0,SZ(block)){ debug("Block "<<i<<'\n'); for(auto j:pre[i]){ debug(j<<" "); } debug('\n'); for(auto j:suf[i]){ debug(j<<" "); } debug('\n'); debug('\n'); } forn(i,0,cnt+2) dp[i]=INF; dp[0]=0; vector<ll> suff; vector<ll> pref; forn(i,1,cnt){ ll mb = myblock[i]; ll mpb = myposblock[i]; ll mp = mypos[i]; ll uso = mpb; ll cost = mypos[block[mb][0]] - mypos[block[mb-1].back()]; if(myblock[i]!=0){ dp[i]=min(dp[i] , suff[min(SZ(suff)-1 ,uso)] + cost*(uso+1) + pre[mb][mpb] ); if(SZ(pref)-(uso+1)>=0) dp[i]=min(dp[i] , pref[SZ(pref)-(uso+1)] + pre[mb][mpb] ); dp[i]=min(dp[i] , pre[mb][mpb] + cost*(uso+1) + dp[block[mb-1].back()]); } debug("dp "<<i<<" "<<dp[i]<<'\n'); if(mpb+1==SZ(block[mb]) && mb+1<SZ(block)){ // nuevo bloque suff.clear(); pref.clear(); for(int j = SZ(block[mb])-1; j>=0; j--){ suff.pb( dp[block[mb][j]-1] + suf[mb][j] ); if(SZ(suff)>=2) suff.back()=min(suff.back(), suff[SZ(suff)-2]); } forn(j,0,SZ(block[mb])){ ll ncosto = mypos[block[mb+1][0]]-mypos[block[mb].back()]; ll nuso = SZ(block[mb])-j; pref.pb( dp[block[mb][j]-1] + suf[mb][j] + ncosto*nuso ); if(SZ(pref)>=2) pref.back()=min(pref.back(),pref[SZ(pref)-2]); } debug("new bloque s-p \n"); for(auto j:suff) debug(j<<" "); debug('\n'); for(auto j:pref) debug(j<<" "); debug('\n'); } } return dp[cnt-1]; }