oj.uz

Submission #332044

# Submission time Handle Problem Language Result Execution time Memory
332044 2020-12-01T09:18:10 Z dolphingarlic Sjekira (COCI20_sjekira) C++14
110 / 110
 49 ms 4584 KB 
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;

vector<pair<int, int>> edges;
ll hardness[100001], ans = 0;
int cmp[100001];

int find(int A) {
    while (cmp[A] != A) cmp[A] = cmp[cmp[A]], A = cmp[A];
    return A;
}

void onion(int A, int B) {
    A = find(A), B = find(B);
    if (A == B) return;
    ans += hardness[A] + hardness[B];
    hardness[B] = max(hardness[B], hardness[A]);
    cmp[A] = B;
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int n;
    cin >> n;
    for (int i = 1; i <= n; i++) cin >> hardness[i];
    for (int i = 1; i < n; i++) {
        int a, b;
        cin >> a >> b;
        if (hardness[a] < hardness[b]) swap(a, b);
        edges.push_back({a, b});
    }
    sort(edges.begin(), edges.end(), [](pair<int, int> A, pair<int, int> B) { return hardness[A.first] < hardness[B.first]; });
    iota(cmp + 1, cmp + n + 1, 1);
    for (pair<int, int> i : edges) onion(i.first, i.second);
    cout << ans;
    return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 364 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 37 ms 3936 KB Output is correct
2 Correct 27 ms 3052 KB Output is correct
3 Correct 26 ms 2924 KB Output is correct
4 Correct 29 ms 3436 KB Output is correct
5 Correct 48 ms 4584 KB Output is correct
6 Correct 47 ms 4584 KB Output is correct
7 Correct 42 ms 4240 KB Output is correct
8 Correct 36 ms 3820 KB Output is correct
9 Correct 23 ms 2540 KB Output is correct
10 Correct 42 ms 4584 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct

Subtask #4
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 37 ms 3936 KB Output is correct
7 Correct 27 ms 3052 KB Output is correct
8 Correct 26 ms 2924 KB Output is correct
9 Correct 29 ms 3436 KB Output is correct
10 Correct 48 ms 4584 KB Output is correct
11 Correct 47 ms 4584 KB Output is correct
12 Correct 42 ms 4240 KB Output is correct
13 Correct 36 ms 3820 KB Output is correct
14 Correct 23 ms 2540 KB Output is correct
15 Correct 42 ms 4584 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 14 ms 1392 KB Output is correct
22 Correct 9 ms 1392 KB Output is correct
23 Correct 47 ms 4376 KB Output is correct
24 Correct 32 ms 3436 KB Output is correct
25 Correct 31 ms 3436 KB Output is correct
26 Correct 22 ms 2288 KB Output is correct
27 Correct 24 ms 2668 KB Output is correct
28 Correct 36 ms 3316 KB Output is correct
29 Correct 21 ms 2160 KB Output is correct
30 Correct 49 ms 4568 KB Output is correct