제출 #1095345

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1095345		vjudge1	Sjekira (COCI20_sjekira)	C++17	110 / 110	33 ms	8020 KiB

sjekira

#include <bits/stdc++.h>

using namespace std;
using ll = long long;

#define int long long
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define FORD(i, a, b) for (int i = (b); i >= (a); i --)
#define REP(i, a) for (int i = 0; i < (a); ++i)
#define REPD(i, a) for (int i = (a) - 1; i >= 0; --i)

#define MASK(i) (1LL << (i))
#define BIT(x, i) (((x) >> (i)) & 1)


constexpr ll LINF = (1ll << 60);
constexpr int INF = (1ll << 30);
constexpr int Mod = 1e9 + 7;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

/*
    Phu Trong from Nguyen Tat Thanh High School for gifted student
*/

template <class X, class Y>
    bool minimize(X &x, const Y &y){
        X eps = 1e-9;
        if (x > y + eps) {x = y; return 1;}
        return 0;
    }

template <class X, class Y>
    bool maximize(X &x, const Y &y){
        X eps = 1e-9;
        if (x + eps < y) {x = y; return 1;}
        return 0;
    }
#define MAX                         100005

int numNode;
int label[MAX];

struct Edge{
    int u, v, w;
    Edge(){}
    Edge(int _u, int _v, int _w): u(_u), v(_v), w(_w){}

    int other(int x){
        return (x ^ u ^ v);
    }
    bool operator < (const Edge &o) const{
        return w < o.w;
    }
} edge[MAX];
struct DSU{
    vector<int> pa, sz, value;
    int sum = 0;
    int n;
    DSU(int _n = 0){
        this -> n = _n;
        pa.resize(n + 5);
        iota(pa.begin(), pa.end(), 0);
        sz.resize(n + 5, 1);
        value.resize(n + 5);
    }
    int find(int u){return u == pa[u] ? u : pa[u] = find(pa[u]);}

    bool joint(int u, int v){
        u = find(u), v = find(v);
        if(u == v) return false;
        if(sz[u] < sz[v]) swap(u, v);
        sz[u] += sz[v];
        sum += value[u] + value[v];
        maximize(value[u], value[v]);
        pa[v] = u;
        return true;
    }
    int answer(void){
        return sum;
    }
};

void process(void){
    cin >> numNode;
    DSU dsu(numNode);
    for (int i = 1; i <= numNode; ++i){
        cin >> label[i];
        dsu.value[i] = label[i];
    }
    for (int i = 1; i < numNode; ++i){
        cin >> edge[i].u >> edge[i].v;
        edge[i].w = max(label[edge[i].u], label[edge[i].v]);
    }
    sort(edge + 1, edge + numNode);
    for (int i = 1; i < numNode; ++i){
        dsu.joint(edge[i].u, edge[i].v);
    }
    cout << dsu.answer();
}
signed main(){
    #define name "Whisper"
    cin.tie(nullptr) -> sync_with_stdio(false);
    //freopen(name".inp", "r", stdin);
    //freopen(name".out", "w", stdout);
    process();
    return (0 ^ 0);
}

• Subtask 1: 10 / 10
• Subtask 2: 10 / 10
• Subtask 3: 30 / 30
• Subtask 4: 60 / 60