11995 Fenced In (Gold) [미완]

 

ㅠㅜㅠㅜㅠㅜㅜㅠㅜㅠ 나중에 다시 봄 하.......................................

 

#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <functional>
#include <string>
#include <queue>
#include <deque>
#include <stack>
#include <set>
#include <map>
#include <cmath>
#include <cstring>
#include <bitset>
#include <stdio.h>
#include <math.h>
#include <sstream>

#define xx first
#define yy second
#define all(x) (x).begin(), (x).end()

using namespace std;
using i64 = long long int;
using ii = pair<int, int>;
using iis = pair<int, string>;
using ii64 = pair<i64, i64>;
using iii = tuple<int, int, int>;

struct Edge {
    int u, v;
    i64 d;
};

int par[4000005];

void Init(int n) {
    for (int i = 0; i <= n; i++) {
        par[i] = i;
    }
}

int Find(int x) {
    if (x == par[x])
        return x;
    return par[x] = Find(par[x]);
}

void Merge(int x, int y) {
    x = Find(x);
    y = Find(y);
    par[x] = y;
}

int main() {
    int a, b, n, m;
    scanf("%d %d %d %d", &a, &b, &n, &m);
    
    Init((n+1) * (m+1));
    
    vector<i64> va(n + 2);
    for (int i = 1; i <= n; i++)
        scanf("%lld", &va[i]);
    vector<i64> vb(m + 2);
    for (int i = 1; i <= m; i++)
        scanf("%lld", &vb[i]);
    va[n + 1] = a;
    vb[m + 1] = b;
    
    sort(all(va));
    sort(all(vb));
    
    vector<int> node1((n+1) * (m+1));
    for (int i = 0; i < node1.size(); i++)
        node1[i] = i;
    
    vector<int> node2;
    for (int i = 0; i < n + 1; i++) {
        for (int j = 0; j < m + 1; j++) {
            node2.push_back((n + 1) * j + i);
        }
    }
    
    vector<Edge> edge;
    for (int i = 0; i < m + 1; i++) {
        for (int j = 1; j < n + 1; j++) {
            Edge e;
            e.u = node1[(n + 1) * i + j - 1];
            e.v = node1[(n + 1) * i + j];
            e.d = vb[i + 1] - vb[i];
            edge.push_back(e);
        }
    }
    
    for (int i = 0; i < n + 1; i++) {
        for (int j = 1; j < m + 1; j++) {
            Edge e;
            e.u = node2[(m + 1) * i + j - 1];
            e.v = node2[(m + 1) * i + j];
            e.d = va[i + 1] - va[i];
            edge.push_back(e);
        }
    }
    
    sort(all(edge), [](const Edge &l, const Edge &r){
       return l.d < r.d; 
    });
    
    i64 ans = 0;
    for (auto e: edge) {
        if (Find(e.u) == Find(e.v))
            continue;
        ans += e.d;
        Merge(e.u, e.v);
    }
    
    printf("%lld\n", ans);
    
    
    return 0;
}