제출 #988669

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
988669		steveonalex	전선 연결 (IOI17_wiring)	C++17	7 / 100	126 ms	69152 KiB

wiring

#include <bits/stdc++.h>
#include "wiring.h"
 
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
 
#define MASK(i) (1ULL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
#define ALL(v) (v).begin(), (v).end()
 
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
 
ll LASTBIT(ll mask){return (mask) & (-mask);}
int pop_cnt(ll mask){return __builtin_popcountll(mask);}
int ctz(ull mask){return __builtin_ctzll(mask);}
int logOf(ull mask){return 63 - __builtin_clzll(mask);}
 
mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
ll rngesus(ll l, ll r){return l + (ull) rng() % (r - l + 1);}
 
template <class T1, class T2>
    bool maximize(T1 &a, T2 b){
        if (a < b) {a = b; return true;}
        return false;
    }
 
template <class T1, class T2>
    bool minimize(T1 &a, T2 b){
        if (a > b) {a = b; return true;}
        return false;
    }
 
template <class T>
    void printArr(T container, string separator = " ", string finish = "\n", ostream &out = cout){
        for(auto item: container) out << item << separator;
        out << finish;
    }
 
template <class T>
    void remove_dup(vector<T> &a){
        sort(ALL(a));
        a.resize(unique(ALL(a)) - a.begin());
    }

const int N = 2002;
const ll INF = 1e18 + 69;

int n, m;
ll dp[N][N];

ll min_total_length(vector<int> a, vector<int> b) {
    n = a.size(), m = b.size();
    for(int i = 0; i<n; ++i) for(int j = 0; j<m; ++j) dp[i][j] = INF;
    dp[0][0] = abs(a[0] - b[0]);
    for(int i = 0; i<n; ++i) for(int j = 0; j<m; ++j){
        if (i + 1 < n){
            minimize(dp[i+1][j], dp[i][j] + abs(a[i+1] - b[j]));
        }
        if (j + 1 < m){
            minimize(dp[i][j+1], dp[i][j] + abs(a[i] - b[j+1]));
        }
        if (i + 1 < n && j + 1 < m){
            minimize(dp[i+1][j+1], dp[i][j] + abs(a[i+1] - b[j+1]));
        }
    }
    return dp[n-1][m-1];
}

// int main(void){
//     ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);

//     int n, m; cin >> n >> m;
//     vector<int> a(n), b(m);
//     for(int i = 0 ; i<n; ++i) cin >> a[i];
//     for(int j = 0; j<m; ++j) cin >> b[j];
//     cout << min_total_length(a, b) << "\n";
    

//     return 0;
// }

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