oj.uz

Submission #374302

# Submission time Handle Problem Language Result Execution time Memory
374302 2021-03-07T07:22:09 Z NONAME Sjekira (COCI20_sjekira) C++17
110 / 110
 85 ms 11236 KB 
#include <bits/stdc++.h>
using namespace std;
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());

const int man = (int)(1e5 + 500);

int n;
int sz[man], c[man], pr[man], x[man], y[man];
long long a[man], val[man];
bool was[man];
vector <array <int, 2> > g[man];
vector <array <int, 2> > ops;

int f(int x) {
    return (x == pr[x]) ? x : pr[x] = f(pr[x]);
}

void un(int x, int y) {
    x = f(x);
    y = f(y);
    if (sz[x] < sz[y]) {
        swap(x, y);
    }
    
    val[x] = max(val[x], val[y]);
    sz[x] += sz[y];
    pr[y] = x;
}

bool cmp(int x, int y) {
    return (a[x] > a[y]);
}

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

    cin >> n;

    for (int i = 0; i < n; ++i) {
        cin >> a[i];
        c[i] = i;
        pr[i] = i;
        val[i] = a[i];
        sz[i] = 1;
    }

    for (int i = 0; i < (n - 1); ++i) {
        cin >> x[i] >> y[i];
        --x[i], --y[i];

        g[x[i]].push_back({y[i], i});
        g[y[i]].push_back({x[i], i});
    }

    sort(c, c + n, cmp);

    for (int i = 0; i < n; ++i) {
        int v = c[i];
        for (auto& u : g[v]) {
            if (was[u[1]] == true) {
                continue;
            }
            was[u[1]] = true;
            ops.push_back({v, u[0]});
        }
    }

    long long ans = 0;
    reverse(ops.begin(), ops.end());
    // cerr << (int)(ops.size()) << "\n";
    for (auto& i : ops) {
        ans += val[f(i[0])] + val[f(i[1])];
        un(i[0], i[1]);
    }

    cout << ans << "\n";

    return 0;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 56 ms 9324 KB Output is correct
2 Correct 43 ms 7528 KB Output is correct
3 Correct 41 ms 7404 KB Output is correct
4 Correct 58 ms 8428 KB Output is correct
5 Correct 79 ms 10596 KB Output is correct
6 Correct 55 ms 10596 KB Output is correct
7 Correct 45 ms 9720 KB Output is correct
8 Correct 43 ms 9188 KB Output is correct
9 Correct 37 ms 6892 KB Output is correct
10 Correct 67 ms 10724 KB Output is correct

Subtask #3
30.0 / 30.0

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

Subtask #4
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2668 KB Output is correct
2 Correct 2 ms 2668 KB Output is correct
3 Correct 2 ms 2668 KB Output is correct
4 Correct 2 ms 2796 KB Output is correct
5 Correct 2 ms 2668 KB Output is correct
6 Correct 56 ms 9324 KB Output is correct
7 Correct 43 ms 7528 KB Output is correct
8 Correct 41 ms 7404 KB Output is correct
9 Correct 58 ms 8428 KB Output is correct
10 Correct 79 ms 10596 KB Output is correct
11 Correct 55 ms 10596 KB Output is correct
12 Correct 45 ms 9720 KB Output is correct
13 Correct 43 ms 9188 KB Output is correct
14 Correct 37 ms 6892 KB Output is correct
15 Correct 67 ms 10724 KB Output is correct
16 Correct 3 ms 2796 KB Output is correct
17 Correct 2 ms 2796 KB Output is correct
18 Correct 2 ms 2796 KB Output is correct
19 Correct 3 ms 2796 KB Output is correct
20 Correct 3 ms 2796 KB Output is correct
21 Correct 17 ms 4844 KB Output is correct
22 Correct 14 ms 4588 KB Output is correct
23 Correct 76 ms 10856 KB Output is correct
24 Correct 60 ms 8940 KB Output is correct
25 Correct 52 ms 8808 KB Output is correct
26 Correct 34 ms 6760 KB Output is correct
27 Correct 39 ms 7280 KB Output is correct
28 Correct 55 ms 9188 KB Output is correct
29 Correct 36 ms 7020 KB Output is correct
30 Correct 85 ms 11236 KB Output is correct