oj.uz

답안 #464729

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
464729 2021-08-13T21:04:29 Z TheScrasse Sjekira (COCI20_sjekira) C++17
110 / 110
 56 ms 8672 KB 
// coci2020_2_4
// Sjekira

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

#define nl "\n"
#define nf endl
#define ll long long
#define pb push_back
#define _ << ' ' <<

#define INF (ll)1e18
#define mod 998244353
#define maxn 100010

ll i, i1, j, k, k1, t, n, m, res, flag[10], a, b;
ll w[maxn], mx[maxn], parent[maxn];
vector<array<ll, 4>> v;

ll find(ll x) {
    if (x == parent[x]) return x;
    return parent[x] = find(parent[x]);
}

void merge(ll a, ll b) {
    a = find(a); b = find(b);
    res += mx[a] + mx[b];
    parent[b] = a; mx[a] = max(mx[a], mx[b]);
}

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);

    /* #if !ONLINE_JUDGE && !EVAL
        ifstream cin("input.txt");
        ofstream cout("output.txt");
    #endif */

    cin >> n;
    for (i = 1; i <= n; i++) {
        cin >> w[i];
    }
    for (i = 0; i < n - 1; i++) {
        cin >> a >> b;
        if (w[a] < w[b]) swap(a, b);
        v.pb({w[a], w[b], a, b});
    }

    sort(v.begin(), v.end());

    for (i = 1; i <= n; i++) {
        parent[i] = i; mx[i] = w[i];
    }

    for (auto u : v) {
        merge(u[2], u[3]);
    }

    cout << res << nl;

    return 0;
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 0 ms 320 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 0 ms 332 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 41 ms 6848 KB Output is correct
2 Correct 31 ms 5136 KB Output is correct
3 Correct 31 ms 4952 KB Output is correct
4 Correct 34 ms 6436 KB Output is correct
5 Correct 51 ms 8036 KB Output is correct
6 Correct 54 ms 8672 KB Output is correct
7 Correct 43 ms 7328 KB Output is correct
8 Correct 40 ms 6784 KB Output is correct
9 Correct 25 ms 4600 KB Output is correct
10 Correct 47 ms 8472 KB Output is correct

Subtask #3
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 0 ms 320 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct

Subtask #4
60.0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 0 ms 320 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 41 ms 6848 KB Output is correct
7 Correct 31 ms 5136 KB Output is correct
8 Correct 31 ms 4952 KB Output is correct
9 Correct 34 ms 6436 KB Output is correct
10 Correct 51 ms 8036 KB Output is correct
11 Correct 54 ms 8672 KB Output is correct
12 Correct 43 ms 7328 KB Output is correct
13 Correct 40 ms 6784 KB Output is correct
14 Correct 25 ms 4600 KB Output is correct
15 Correct 47 ms 8472 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 12 ms 2124 KB Output is correct
22 Correct 13 ms 1996 KB Output is correct
23 Correct 52 ms 7568 KB Output is correct
24 Correct 37 ms 6460 KB Output is correct
25 Correct 36 ms 6452 KB Output is correct
26 Correct 24 ms 3792 KB Output is correct
27 Correct 29 ms 4420 KB Output is correct
28 Correct 39 ms 6212 KB Output is correct
29 Correct 27 ms 3820 KB Output is correct
30 Correct 56 ms 8172 KB Output is correct