제출 #1060272

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

wiring

#include "wiring.h"
#include <bits/stdc++.h>
using namespace std;
#define pii pair<int, int>
#define oo 1e9

const int MAX = 2e5 + 5;
int pre[MAX];
int prex[MAX];
vector<pii> v;
int n;

long long min_total_length(std::vector<signed> r, std::vector<signed> b) {
    #define int long long
	v = {{0, 0}};
    n = r.size() + b.size();
    for(int a : r) v.push_back({a, 0});
    for(int a : b) v.push_back({a, 1});
    sort(v.begin() + 1, v.end());
    for(int i = 1; i <= n; i++){
    }
    map<int, int> mp;
    vector<int> dp(n + 1, 0);
    vector<int> clo(2, -oo);
    mp[0] = 0;
    for(int i = 1; i <= n; i++){
        pre[i] = pre[i - 1] + ((v[i].second)? -1 : 1);
        prex[i] = prex[i - 1] + ((v[i].second)? -1 : 1) * v[i].first;
        dp[i] = dp[i - 1] + v[i].first - clo[v[i].second ^ 1];
        clo[v[i].second] = v[i].first;
        if(mp.count(pre[i])){
            int id = mp[pre[i]];
            dp[i] = min(dp[id] + abs(prex[i] - prex[id]), dp[i]); 
        }
        mp[pre[i]] = i;
    }
    #undef int
    return dp[n];
}

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