제출 #254627

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
254627		Hehehe	전선 연결 (IOI17_wiring)	C++14	7 / 100	37 ms	32000 KiB

wiring

#include<bits/stdc++.h> //:3
using namespace std;
typedef long long ll;
#define all(a) (a).begin(), (a).end()
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define rc(s) return cout<<s,0
#define pi pair <int, int>
#define sz(x) (int)((x).size())

#include "wiring.h"

const int N = 2e3 + 11;

ll dp[N][N];

ll min_total_length(vector<int> r, vector<int> b){
    vector<ll>red, blue;

    red.push_back(0);
    blue.push_back(0);

    for(auto it : r)red.push_back((ll)it);
    for(auto it : b)blue.push_back((ll)it);
    
    if(sz(r) <= 200 && sz(b) <= 200){
        
        memset(dp, 0x3f, sizeof(dp));


        dp[0][0] = 0;

        for(int i = 1; i < sz(red); i++){
            for(int j = 1; j < sz(blue); j++){
                dp[i][j] = min({dp[i - 1][j], dp[i][j - 1], dp[i - 1][j - 1]}) + abs(red[i] - blue[j]);
            }
        }

        return dp[sz(red) - 1][sz(blue) - 1];
    }
    
    
    ll ans = 0;
    
    for(int i = 1; i < sz(red); i++){
        ans += (red[sz(red) - 1] - red[i]);
    }
    
    for(int i = 1; i < sz(blue); i++){
        ans += (blue[i] - blue[1]);
    }
    
    ans += max(sz(r), sz(b))*(blue[0] - red[sz(r)]);

    return ans;
}

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