제출 #660945

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
660945		urosk	전선 연결 (IOI17_wiring)	C++14	13 / 100	22 ms	3412 KiB

wiring

#include "wiring.h"
#include <bits/stdc++.h>
#define ll long long
#define sz(a) (ll)(a.size())
#define pb push_back
#define popb pop_back
#define all(a) a.begin(),a.end()
#define llinf 1000000000000000LL
#define here cerr<<"===================================\n"
#define endl '\n'
#define ceri(a,l,r) {for(ll i_ = l;i_<=r;i_++) cerr<<a[i_]<< " ";cerr<<endl;}
using namespace std;
#define maxn 200005
ll n,m,ans,it;
ll a[maxn],c[maxn];
ll last[maxn][2];
ll nxt[maxn][2];
ll col[maxn];
long long min_total_length(vector<int> r, vector<int> b) {
    for(ll x : r) a[++n] = x;
    for(ll x : b) c[++m] = x;
    if(a[n]<c[1]){
        reverse(all(r));
        while(sz(r)>1&&sz(b)>1){
            ans+=abs(r.back()-b.back());
            r.popb(); b.popb();
        }
        if(sz(r)<sz(b)) swap(r,b);
        for(ll x : r) ans+=abs(x-b[0]);
        return ans;
    }
    if(sz(r)>sz(b)) swap(r,b);
    n = m = 0;
    for(ll x : r) a[++n] = x;
    for(ll x : b) c[++m] = x;
    ll i = 0,j = 0;
    while(i<n&&j<m){
        if(r[i]<b[j]) col[++it] = 1,i++;
        else col[++it] = 0,j++;
    }
    while(i<n) col[++it] = 1,i++;
    while(j<n) col[++it] = 0,j++;
    vector<ll> v(2,llinf);
    for(ll i = 1;i<=n+m;i++){
        last[i][0] = v[0]; last[i][1] = v[1];
        v[col[i]] = i;
    }
    v[0] = llinf; v[1] = llinf;
    for(ll i = n+m;i>=1;i--){
        nxt[i][0] = v[0]; nxt[i][1] = v[1];
        v[col[i]] = i;
    }
    set<ll> s;
    for(ll x : b) s.insert(x);
    for(ll i = 1;i<=n;i++){
        ll x = a[i];
        auto it = s.lower_bound(x);
        ll y = llinf;
        if(it!=s.end()){
            if(abs(x-y)>abs(x-*it)) y = *it;
        }
        if(it!=s.begin()){
            it--;
            if(abs(x-y)>abs(x-*it)) y = *it;
        }
        if(y!=*it) it++;
        s.erase(it);
        ans+=abs(x-y);
    }
    for(ll i = 1;i<=m;i++){
        ll x = c[i];
        if(s.find(x)==s.end()) continue;
        ll lf = last[x][1],rf = nxt[x][1];
        ans+=min(abs(x-lf),abs(rf-x));
    }
	return ans;
}

• Subtask 1: 0 / 7
• Subtask 2: 13 / 13
• Subtask 3: 0 / 10
• Subtask 4: 0 / 25
• Subtask 5: 0 / 45