oj.uz

답안 #630173

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
630173 2022-08-15T20:02:05 Z Hacv16 Sjekira (COCI20_sjekira) C++17
110 / 110
 80 ms 58940 KB 
#include<bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;

const int MAX = 2e6 + 15;
const int INF = 0x3f3f3f3f;
const int MOD = 1e9 + 7;

#define pb push_back
#define sz(x) (int) x.size()
#define fr first
#define sc second
#define mp make_pair
#define all(x) x.begin(), x.end()
#define dbg(x) cerr << #x << ": " << "[ " << x << " ]\n"

ll n, t[MAX], pai[MAX], mark[MAX], mx[MAX], sze[MAX], ans;
vector<ll> adj[MAX];

ll find(ll u){
    if(pai[u] == u) return u;
    return pai[u] = find(pai[u]);
}

ll join(ll u, ll v){
    u = find(u), v = find(v);
    if(u == v) return 0;

    if(sze[v] > sze[u]) swap(u, v);

    ll cut = mx[u] + mx[v];
    pai[v] = u, sze[u] += sze[v], mx[u] = max(mx[u], mx[v]);
    return cut;
}

ll getMax(ll u){
    return mx[find(u)];
}

bool cmp(ll u, ll v){
    return t[u] > t[v];
}

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL); 

    cin >> n;

    for(int i = 1; i <= n; i++)
        cin >> t[i];

    for(int i = 1; i < n; i++){
        ll u, v; cin >> u >> v; 
        adj[u].pb(v); adj[v].pb(u);
    }

    for(int i = 1; i <= n; i++)
        pai[i] = i, mx[i] = t[i], sze[i] = 1;

    vector<ll> order(n);
    iota(all(order), 1);
    sort(all(order), cmp);

    vector<pii> edges;

    for(auto u : order){
        for(auto v : adj[u]){
            if(mark[v]) continue;
            edges.pb({u, v});
        }

        mark[u] = true;
    }

    reverse(all(edges));

    for(auto e : edges)
        ans += join(e.fr, e.sc);

    cout << ans << '\n';

    return 0;
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 22 ms 47316 KB Output is correct
2 Correct 27 ms 47248 KB Output is correct
3 Correct 24 ms 47220 KB Output is correct
4 Correct 25 ms 47248 KB Output is correct
5 Correct 23 ms 47308 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 62 ms 54828 KB Output is correct
2 Correct 52 ms 54088 KB Output is correct
3 Correct 52 ms 53780 KB Output is correct
4 Correct 54 ms 55012 KB Output is correct
5 Correct 75 ms 58308 KB Output is correct
6 Correct 63 ms 58136 KB Output is correct
7 Correct 57 ms 56828 KB Output is correct
8 Correct 53 ms 56100 KB Output is correct
9 Correct 53 ms 52924 KB Output is correct
10 Correct 68 ms 58156 KB Output is correct

Subtask #3
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 22 ms 47316 KB Output is correct
2 Correct 27 ms 47248 KB Output is correct
3 Correct 24 ms 47220 KB Output is correct
4 Correct 25 ms 47248 KB Output is correct
5 Correct 23 ms 47308 KB Output is correct
6 Correct 24 ms 47544 KB Output is correct
7 Correct 21 ms 47420 KB Output is correct
8 Correct 22 ms 47332 KB Output is correct
9 Correct 22 ms 47444 KB Output is correct
10 Correct 22 ms 47308 KB Output is correct

Subtask #4
60.0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 22 ms 47316 KB Output is correct
2 Correct 27 ms 47248 KB Output is correct
3 Correct 24 ms 47220 KB Output is correct
4 Correct 25 ms 47248 KB Output is correct
5 Correct 23 ms 47308 KB Output is correct
6 Correct 62 ms 54828 KB Output is correct
7 Correct 52 ms 54088 KB Output is correct
8 Correct 52 ms 53780 KB Output is correct
9 Correct 54 ms 55012 KB Output is correct
10 Correct 75 ms 58308 KB Output is correct
11 Correct 63 ms 58136 KB Output is correct
12 Correct 57 ms 56828 KB Output is correct
13 Correct 53 ms 56100 KB Output is correct
14 Correct 53 ms 52924 KB Output is correct
15 Correct 68 ms 58156 KB Output is correct
16 Correct 24 ms 47544 KB Output is correct
17 Correct 21 ms 47420 KB Output is correct
18 Correct 22 ms 47332 KB Output is correct
19 Correct 22 ms 47444 KB Output is correct
20 Correct 22 ms 47308 KB Output is correct
21 Correct 36 ms 50104 KB Output is correct
22 Correct 31 ms 49820 KB Output is correct
23 Correct 78 ms 58424 KB Output is correct
24 Correct 65 ms 55688 KB Output is correct
25 Correct 61 ms 55516 KB Output is correct
26 Correct 45 ms 52636 KB Output is correct
27 Correct 49 ms 53520 KB Output is correct
28 Correct 60 ms 55656 KB Output is correct
29 Correct 47 ms 52792 KB Output is correct
30 Correct 80 ms 58940 KB Output is correct