제출 #851178

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

wiring

#include "wiring.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF=1e15;
ll dp[200001],mn[200001],val[200002],sum[200001];
pair <int, int> position[200001];
int id,cur[2],l,r,lo;
ll min_total_length(vector <int> a, vector <int> b){
    for (int i:a)
        position[++id]={i,0};
    for (int i:b)
        position[++id]={i,1};
    sort(position+1,position+id+1);
    for (int i=id;i;i--){
        val[i]=cur[position[i].second^1]-position[i].first;
        if (i<id&&position[i+1].second==position[i].second)
            val[i]+=val[i+1];
        if (position[i].second!=position[i-1].second)
            cur[position[i].second]=position[i].first;
    }
    for (int i=1;i<=id;i++)
        sum[i]=sum[i-1]+position[i].first;
    mn[0]=val[1];
    for (int i=1;i<=id;i++){
        dp[i]=INF;
        if (l){
            if (i-r>=r-l+1)
                dp[i]=dp[l-1]+sum[i]-sum[r]*2+sum[l-1]-position[r].first*(i-r*2+l-1);
            else
                dp[i]=mn[r*2-i]-val[r*2-i+1]+sum[i]-sum[r]*2+sum[r*2-i];
        }
        mn[i]=min(mn[i-1],dp[i]+val[i+1]);
        if (i==1||position[i-1].second!=position[i].second){
            lo=i;
            mn[i]=min(dp[i-1]+val[i],dp[i]+val[i+1]);
        }
        if (position[i].second!=position[i+1].second){
            l=lo;
            r=i;
        }
    }
	return dp[id];
}

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