제출 #497304

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
497304		kevin	전선 연결 (IOI17_wiring)	C++17	0 / 100	1 ms	288 KiB

wiring

#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];
    // 0 = <, 1 = >, so add
    // 0 is pref, 1 is posts
    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);
        // ca(v); nl;
        p++;
        // cout<<p<<" ";
        ll iv = (p == (int)ar.size()?0:ar[p].f-x);
        if(pv == -1){
            val[0] = val[1] = vector<ll>(v.size() + 1, 1e18);
            ll sm = 0;
            for(ll i:v) sm = sm + i;
            val[0][v.size()] = val[1][v.size()] = sm;
            val[1][v.size()] += iv * v.size();
        }
        else{
            vector<ll> nxt[2]; nxt[0] = nxt[1] = vector<ll>(v.size() + 1);
            ll lsm = 0;
            ll rsm = 0;
            for(int i=0; i<(int)v.size(); i++) rsm += v.back() - v[i];
            // cout<<rsm<<"\n";
            for(int i=0; i<=(int)v.size(); i++){
                if(i) {
                    lsm += v[i-1] - v[0];
                    rsm -= v.back() - v[i-1];
                }
                int id = min(i, (int)val[0].size()-1);
                // cout<<"Val: "<<(int)(v.size()-i) * (x-pv)<<" "<<(i<(int)val[1].size()?val[1][i]:1e18)<<" "<<lsm<<" "<<rsm<<"\n";
                nxt[0][v.size()-i] = min(val[0][id] + (i) * (x-pv), (ll)(i<(int)val[1].size()?val[1][i]:1e18)) + lsm + rsm;
                nxt[1][v.size()-i] = nxt[0][v.size()-i] + (v.size()-i) * iv;
            }
            val[0] = nxt[0];
            val[1] = nxt[1];
            nxt[0].clear(); nxt[1].clear();
        }
        pv = x;
        // ca(val[0]); nl; ca(val[1]); nl;
        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()-1-i], val[1][val[0].size()-i]);
        }
        // ca(val[0]); nl; ca(val[1]); nl; nl;
    }
    return val[0].back();
}

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