Kindergarten

#include <bits/stdc++.h>
using namespace std;

#define all(x)  begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define sz(x)   (int)(x).size()                                 // signed size: avoids the unsigned .size() wrap bug

using ll  = long long;
using pii = pair<int,int>;
using vi  = vector<int>;

#ifdef LOCAL                                                    // compile with -DLOCAL to enable, silent on the judge
#define dbg(...) cerr << "[" << #__VA_ARGS__ << "] = ", dbg_out(__VA_ARGS__)
template<class T> void dbg_out(T x) { cerr << x << '\n'; }
template<class T, class... R> void dbg_out(T x, R... r) { cerr << x << ", "; dbg_out(r...); }
#else
#define dbg(...)
#endif



int p[100005];
int find(int x){ while(p[x]!=x) x = p[x] = p[p[x]]; return x; }

int main() {
    cin.tie(0)->sync_with_stdio(0);                             // never mix with scanf/printf after this
    int n; cin >> n; 
    // int n,m; cin >> n >> m; 
    // vi a(n); for (auto &x : a) cin >> x;
    
    for(int i=1;i<=n;i++) p[i]=i; // each is root
    vi idege;
    vi jdege;
    vi vdege;
    for (int i = 0; i < n; i++)
    {
        // string s;
        // cin >> s;
        for (int j = 0; j < n; j++)
        {
            // col_count[j] = 0;
            // bool val = s[j] == '#';
            // matrix[i][j] = val;
            // if (val){
            //     stamp_count++;
            // }

            idege.push_back(i);
            jdege.push_back(j);
            int inp;
            cin >> inp;
            vdege.push_back(inp);
            
        }
    }

    vi perm;
    for (int i = 0; i < n*n; i++)
    {
        perm.push_back(i);
    }


    sort(perm.begin(), perm.end(), [&](int a, int b){ 
        
        return vdege[a] < vdege[b]; 
        // return list[a] + list[b] > list[b] + list[a]; 
        // cout << list[b] + list[a] << "\n";
        // return (list[b] + list[a]) > (list[a] + list[b]); 
    
    });


    multiset<int> conn;

    ll total_value = 0;
    int links = 0;
    for (int i = 0; i < n*n; i++)
    {
        int idx = perm[i];

        int val = vdege[idx];
        int ii = idege[idx];
        int jj = jdege[idx];
        if (ii >= jj){
            continue;
        }

        if(conn.count(ii) >= 2 || conn.count (jj) >= 2){
            // cout << "skip " << ii << " " << jj << " " << val << "\n" ;

            continue;
        }

        if (find(ii) == find(jj)){
            continue;
        }
        
        // add it
        // cout << ii << " " << jj << " " << val << "\n" ;
        total_value += val;
        
        conn.insert(ii);
        conn.insert(jj);

        p[find(ii)] = find(jj);          // no rank needed, path compression is enough here


        links ++;
        if(links >= n-1 ){
            cout << total_value;
            break;
        }


    }
    

    




    // cout << ;
    return 0;
}

Test 1

Verdict: WRONG ANSWER

Test 2

Verdict: WRONG ANSWER

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED

Test 11

Verdict: ACCEPTED

Test 12

Verdict: ACCEPTED

Test 13

Verdict: ACCEPTED

Test 14

Verdict: ACCEPTED

Test 15

Verdict: ACCEPTED

Test 16

Verdict: ACCEPTED

Test 17

Verdict: ACCEPTED

Test 18

Verdict: ACCEPTED

Test 19

Verdict: ACCEPTED

Test 20

Verdict: ACCEPTED

Test 21

Verdict: ACCEPTED

Test 22

Verdict: ACCEPTED

Test 23

Verdict: ACCEPTED

Test 24

Verdict: ACCEPTED

Test 25

Verdict: ACCEPTED

Test 26

Verdict: ACCEPTED

Test 27

Verdict: ACCEPTED

Test 28

Verdict: ACCEPTED

Test 29

Verdict: ACCEPTED

Test 30

Verdict: ACCEPTED

Test 31

Verdict: ACCEPTED

Test 32

Verdict: ACCEPTED

Test 33

Verdict: ACCEPTED

Test 34

Verdict: ACCEPTED

Test 35

Verdict: ACCEPTED

Test 36

Verdict: ACCEPTED

Test 37

Verdict: ACCEPTED

Test 38

Verdict: ACCEPTED

Test 39

Verdict: ACCEPTED

Test 40

Verdict: ACCEPTED

Test 41

Verdict: ACCEPTED

Test 42

Verdict: ACCEPTED

Test 43

Verdict: ACCEPTED

Test 44

Verdict: ACCEPTED

Test 45

Verdict: ACCEPTED

Test 46

Verdict: ACCEPTED

Test 47

Verdict: ACCEPTED

Test 48

Verdict: ACCEPTED

Test 49

Verdict: ACCEPTED

Test 50

Verdict: ACCEPTED

Test 51

Verdict: ACCEPTED

Test 52

Verdict: ACCEPTED

Test 53

Verdict: ACCEPTED

Test 54

Verdict: ACCEPTED

Test 55

Verdict: ACCEPTED

Test 56

Verdict: ACCEPTED

Test 57

Verdict: ACCEPTED

Test 58

Verdict: ACCEPTED

Test 59

Verdict: ACCEPTED

Test 60

Verdict: ACCEPTED

Test 61

Verdict: ACCEPTED

Test 62

Verdict: ACCEPTED

Test 63

Verdict: ACCEPTED

Test 64

Verdict: ACCEPTED

Test 65

Verdict: ACCEPTED

Test 66

Verdict: ACCEPTED

Test 67

Verdict: ACCEPTED

Test 68

Verdict: ACCEPTED

Test 69

Verdict: ACCEPTED

Test 70

Verdict: ACCEPTED

Test 71

Verdict: ACCEPTED

Test 72

Verdict: ACCEPTED

Test 73

Verdict: ACCEPTED

Test 74

Verdict: ACCEPTED

Test 75

Verdict: ACCEPTED

Test 76

Verdict: ACCEPTED

Test 77

Verdict: ACCEPTED

Test 78

Verdict: ACCEPTED

Test 79

Verdict: ACCEPTED

Test 80

Verdict: ACCEPTED

Test 81

Verdict: ACCEPTED

Test 82

Verdict: ACCEPTED

Test 83

Verdict: ACCEPTED

Test 84

Verdict: ACCEPTED

Test 85

Verdict: ACCEPTED

Test 86

Verdict: ACCEPTED

Test 87

Verdict: ACCEPTED

Test 88

Verdict: ACCEPTED

Test 89

Verdict: ACCEPTED

Test 90

Verdict: ACCEPTED