Submission #313231

#	Time	Username	Problem	Language	Result	Execution time	Memory
313231		talant117408	전선 연결 (IOI17_wiring)	C++17	0 / 100	1 ms	384 KiB

wiring

#include "wiring.h"
#include <bits/stdc++.h>

using namespace std;
 
typedef long long ll;
typedef pair <ll, ll> pii;
 
#define precision(n) fixed << setprecision(n)
#define pb push_back
#define ub upper_bound
#define lb lower_bound
#define mp make_pair
#define eps (double)1e-9
#define PI 2*acos(0.0)
#define endl "\n"
#define sz(v) (int)(v).size()
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define do_not_disturb ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);

const int N = 2e5+7;
ll dp[N], pref[N], last[N];

ll min_total_length(vector<int> r, vector<int> b){
    
    vector <pii> v;
    int n = sz(r)+sz(b);
    for(auto to : r)
        v.pb(mp(to, 0));
    for(auto to : b)
        v.pb(mp(to, 1));
    
    sort(all(v));
    
    dp[0] = 1e18;
    pref[0] = v[0].first;
    last[0] = -1;
    
    for(int i = 1; i < n; i++){
        dp[i] = 1e18;
        pref[i] = pref[i-1]+v[i].first;
        last[i] = (v[i].second == v[i-1].second ? last[i-1] : i-1);
        
        if(last[i] == -1) continue;
        
        dp[i] = min(dp[i], dp[i-1]+v[i].first-v[last[i]].first);
        
        if(last[last[i]] < last[i]-(i-last[i])+1){
            dp[i] = min(dp[i], (pref[i] - pref[last[i]]) - (pref[last[i]] - pref[last[i]-(i-last[i])])
                                +(last[i]-(i-last[i]) < 0 ? 0 : dp[last[i]-(i-last[i])]));
        }
    }
    
    return dp[n-1];
}

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