oj.uz

Submission #472124

# Submission time Handle Problem Language Result Execution time Memory
472124 2021-09-13T06:07:48 Z abc864197532 Sjekira (COCI20_sjekira) C++17
110 / 110
 103 ms 12684 KB 
/*
 *   ##   #####   ####      ####  #    #  ####
 *  #  #  #    # #    #    #    # #    # #    #
 * #    # #####  #         #    # #    # #    #
 * ###### #    # #         #    # # ## # #    #
 * #    # #    # #    #    #    # ##  ## #    #
 * #    # #####   ####      ####  #    #  ####
 */
#include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define pii pair <int, int>
#define X first
#define Y second
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define info() cout << __PRETTY_FUNCTION__ << ": " << __LINE__ << endl
void abc() {cout << endl;}
template <typename T, typename ...U> void abc(T a, U ...b) {
    cout << a << ' ', abc(b...);
}
template <typename T> void printv(T l, T r) {
    while (l != r) cout << *l << " \n"[++l == r];
}
template <typename A, typename B> istream& operator >> (istream& o, pair<A, B> &a) {
    return o >> a.X >> a.Y;
}
template <typename A, typename B> ostream& operator << (ostream& o, pair<A, B> a) {
    return o << '(' << a.X << ", " << a.Y << ')';
}
template <typename T> ostream& operator << (ostream& o, vector<T> a) {
    bool is = false;
    if (a.empty) o << '{';
    for (T i : a) {o << (is ? ' ' : '{'), is = true, o << i;}
    return o << '}';
}
template <typename T> struct vv : vector <vector <T>> {
    vv(int n, int m, T v) : vector <vector <T>> (n, vector <T>(m, v)) {}
    vv() {}
};
template <typename T> struct vvv : vector <vv <T>> {
    vvv(int n, int m, int k, T v) : vector <vv <T>> (n, vv <T>(m, k, v)) {}
    vvv() {}
};
#ifdef Doludu
#define test(args...) info(), abc("[" + string(#args) + "]", args)
#define owo freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout)
#else
#define test(args...) void(0)
#define owo ios::sync_with_stdio(false); cin.tie(0)
#endif
const int mod = 1e9 + 7, N = 200001, logN = 20, K = 80000;

vector <int> adj[N];
vector <int> dsu;

int Find(int x) {
    if (dsu[x] == x) return x;
    return dsu[x] = Find(dsu[x]);
}

int main () {
    owo;
    int n;
    cin >> n;
    vector <int> a(n);
    for (int i = 0; i < n; ++i) {
        cin >> a[i];
    }
    for (int i = 0, u, v; i < n - 1; ++i) {
        cin >> u >> v, --u, --v;
        adj[u].pb(v);
        adj[v].pb(u);
    }
    vector <int> p(n);
    iota(all(p), 0);
    sort(all(p), [&](int i, int j) {
        return a[i] > a[j];
    });
    dsu.resize(n);
    iota(all(dsu), 0);
    vector <pii> tmp;
    lli ans = 0;
    for (int i : p) {
        for (int j : adj[i]) if (a[i] > a[j] || (a[i] == a[j] && i > j)) {
            tmp.eb(i, j);
        }
    }
    reverse(all(tmp));
    for (pii i : tmp) {
        ans += a[Find(i.X)] + a[Find(i.Y)];
        i.X = Find(i.X), i.Y = Find(i.Y);
        if (a[i.X] > a[i.Y]) swap(i.X, i.Y);
        dsu[i.X] = i.Y;
    }
    cout << ans << endl;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4940 KB Output is correct
2 Correct 3 ms 4940 KB Output is correct
3 Correct 3 ms 5008 KB Output is correct
4 Correct 3 ms 4940 KB Output is correct
5 Correct 3 ms 4944 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 59 ms 9552 KB Output is correct
2 Correct 40 ms 8360 KB Output is correct
3 Correct 40 ms 8132 KB Output is correct
4 Correct 43 ms 9000 KB Output is correct
5 Correct 65 ms 10524 KB Output is correct
6 Correct 52 ms 10712 KB Output is correct
7 Correct 49 ms 11660 KB Output is correct
8 Correct 41 ms 11096 KB Output is correct
9 Correct 32 ms 9096 KB Output is correct
10 Correct 66 ms 12684 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4940 KB Output is correct
2 Correct 3 ms 4940 KB Output is correct
3 Correct 3 ms 5008 KB Output is correct
4 Correct 3 ms 4940 KB Output is correct
5 Correct 3 ms 4944 KB Output is correct
6 Correct 4 ms 5068 KB Output is correct
7 Correct 3 ms 4940 KB Output is correct
8 Correct 3 ms 4940 KB Output is correct
9 Correct 3 ms 5068 KB Output is correct
10 Correct 4 ms 5068 KB Output is correct

Subtask #4
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4940 KB Output is correct
2 Correct 3 ms 4940 KB Output is correct
3 Correct 3 ms 5008 KB Output is correct
4 Correct 3 ms 4940 KB Output is correct
5 Correct 3 ms 4944 KB Output is correct
6 Correct 59 ms 9552 KB Output is correct
7 Correct 40 ms 8360 KB Output is correct
8 Correct 40 ms 8132 KB Output is correct
9 Correct 43 ms 9000 KB Output is correct
10 Correct 65 ms 10524 KB Output is correct
11 Correct 52 ms 10712 KB Output is correct
12 Correct 49 ms 11660 KB Output is correct
13 Correct 41 ms 11096 KB Output is correct
14 Correct 32 ms 9096 KB Output is correct
15 Correct 66 ms 12684 KB Output is correct
16 Correct 4 ms 5068 KB Output is correct
17 Correct 3 ms 4940 KB Output is correct
18 Correct 3 ms 4940 KB Output is correct
19 Correct 3 ms 5068 KB Output is correct
20 Correct 4 ms 5068 KB Output is correct
21 Correct 17 ms 6884 KB Output is correct
22 Correct 15 ms 6604 KB Output is correct
23 Correct 83 ms 12284 KB Output is correct
24 Correct 52 ms 10508 KB Output is correct
25 Correct 48 ms 10536 KB Output is correct
26 Correct 33 ms 8524 KB Output is correct
27 Correct 40 ms 8964 KB Output is correct
28 Correct 53 ms 10480 KB Output is correct
29 Correct 35 ms 8536 KB Output is correct
30 Correct 103 ms 12604 KB Output is correct