Submission #2700518

---

Source Code Expand

#include <cmath>
#include <iostream>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <tuple>
#include <algorithm>
#include <utility>
#include <iomanip>

#define int long long int
#define rep(i, n) for(int i = 0; i < (n); ++i)

using namespace std;

typedef pair<int, int> P;

const int INF = 1e15;
const int MOD = 1e9+7;

int find(int v, vector<int>& p){
    if(p[v] == -1){
        return v;
    }
    p[v] = find(p[v], p);
    return p[v];
}

void unite(int u, int v, vector<int>& p){
    int u_root = find(u, p);
    int v_root = find(v, p);

    if(u_root == v_root){
        return;
    }
    p[u_root] = v_root;
}

signed main(){
    int w, h;
    cin >> w >> h;
    vector<tuple<int, int, int>> edge;
    rep(i, w){
        int p;
        cin >> p;
        edge.emplace_back(p, i, 0);
    }
    rep(i, h){
        int q;
        cin >> q;
        edge.emplace_back(q, i, 1);
    }
    sort(edge.begin(), edge.end());

    vector<int> parent((w+1) * (h+1), -1);
    int ans = 0;
    rep(i, w+h){
        if(get<2>(edge[i]) == 0){
            int ww = get<1>(edge[i]);
            rep(j, h+1){
                int u = find((w+1)*j+ww, parent);
                int v = find((w+1)*j+ww+1, parent);
                if(u == v){
                    continue;
                }
                unite(u, v, parent);
                ans += get<0>(edge[i]);
            }
        }else{
            int hh = get<1>(edge[i]);
            rep(j, w+1){
                int u = find((w+1)*hh+j, parent);
                int v = find((w+1)*(hh+1)+j, parent);
                if(u == v){
                    continue;
                }
                unite(u, v, parent);
                ans += get<0>(edge[i]);
            }
        }
    }
    cout << ans << endl;
    return 0;
}

Submission Info

Judge Result