제출 #654551

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
654551		Ronin13	전선 연결 (IOI17_wiring)	C++14	100 / 100	48 ms	13244 KiB

wiring

#include "wiring.h"
#include <bits/stdc++.h>
#define ll long long
#define ull unsigned ll
#define f first
#define s second
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pb push_back
#define epb emplace_back
using namespace std;

const ll linf = 1e18  + 1;

long long min_total_length(std::vector<int> r, std::vector<int> b) {
    vector <pll> a;
    a.pb({-1, 0});
    for(int to : r){
        a.pb({to, 1});
    }
    for(int to : b){
        a.pb({to, 2});
    }
    sort(a.begin(), a.end());
    vector <ll> dp(a.size(), linf), suf(a.size()), pref(a.size(), linf);
    vector <ll> st(a.size());
    dp[0] = 0;
    for(int i = 1; i < a.size(); i++){
        int j = i - 1;
        while(j + 1 < a.size() && a[j + 1].s == a[i].s) j++, st[j] = i;
        ll d = a[i].f - a[i - 1].f;
        if(i > 1){
            ll s = 0;
            for(int k = i; k <= j; k++){
                s += a[k].f - a[i].f;
                //cout << s << ' ';
                ll l = k - i + 1;
                int x = max(st[i - 1], (ll)i - l);
                dp[k] = suf[x] + s + d * l;
               // cout << dp[k] << ' ';
                if(i - l >= st[i - 1])
                    dp[k] = min(dp[k], pref[x] + s);
            }
        }
        if(j == a.size() - 1) {

            return dp[j];
        }
        ll s = 0;
        d = a[j + 1].f - a[j].f;
        for(int k = j; k >= i; k--){
            s += a[j].f - a[k].f;
            if(k != j)
            suf[k] = min(min(dp[k - 1], dp[k]) + s, suf[k + 1]);
            else suf[k] = min(dp[k - 1] + s, dp[k] + s);
            ll x = j - k + 1;
            pref[k] = min(dp[k - 1], dp[k]) + s + x * d;
        }
        for(int k = i + 1; k <= j; k++){
            pref[k] = min(pref[k], pref[k - 1]);
        }
        i = j;
    }
	return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

wiring.cpp: In function 'long long int min_total_length(std::vector<int>, std::vector<int>)':
wiring.cpp:28:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   28 |     for(int i = 1; i < a.size(); i++){
      |                    ~~^~~~~~~~~~
wiring.cpp:30:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   30 |         while(j + 1 < a.size() && a[j + 1].s == a[i].s) j++, st[j] = i;
      |               ~~~~~~^~~~~~~~~~
wiring.cpp:45:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   45 |         if(j == a.size() - 1) {
      |            ~~^~~~~~~~~~~~~~~

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