oj.uz

Submission #374299

# Submission time Handle Problem Language Result Execution time Memory
374299 2021-03-07T07:15:51 Z NONAME Sjekira (COCI20_sjekira) C++17
50 / 110
 868 ms 11508 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 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);
    
    val[x] = max(val[x], val[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];
    }

    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 3 ms 2668 KB Output is correct
4 Correct 2 ms 2668 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 57 ms 9068 KB Output is correct
2 Correct 46 ms 7272 KB Output is correct
3 Correct 40 ms 7148 KB Output is correct
4 Correct 46 ms 8172 KB Output is correct
5 Correct 72 ms 10340 KB Output is correct
6 Correct 59 ms 11508 KB Output is correct
7 Correct 54 ms 9952 KB Output is correct
8 Correct 40 ms 9568 KB Output is correct
9 Correct 40 ms 7400 KB Output is correct
10 Correct 59 ms 11104 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 3 ms 2668 KB Output is correct
4 Correct 2 ms 2668 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
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 3 ms 2668 KB Output is correct
4 Correct 2 ms 2668 KB Output is correct
5 Correct 2 ms 2668 KB Output is correct
6 Correct 57 ms 9068 KB Output is correct
7 Correct 46 ms 7272 KB Output is correct
8 Correct 40 ms 7148 KB Output is correct
9 Correct 46 ms 8172 KB Output is correct
10 Correct 72 ms 10340 KB Output is correct
11 Correct 59 ms 11508 KB Output is correct
12 Correct 54 ms 9952 KB Output is correct
13 Correct 40 ms 9568 KB Output is correct
14 Correct 40 ms 7400 KB Output is correct
15 Correct 59 ms 11104 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 4716 KB Output is correct
22 Correct 16 ms 4460 KB Output is correct
23 Correct 76 ms 10472 KB Output is correct
24 Correct 55 ms 8684 KB Output is correct
25 Correct 54 ms 8680 KB Output is correct
26 Correct 35 ms 6504 KB Output is correct
27 Correct 40 ms 7024 KB Output is correct
28 Incorrect 868 ms 9028 KB Output isn't correct
29 Halted 0 ms 0 KB -