oj.uz

Submission #892082

# Submission time Handle Problem Language Result Execution time Memory
892082 2023-12-24T18:39:55 Z kh0i Sjekira (COCI20_sjekira) C++17
110 / 110
 37 ms 7236 KB 
#include "bits/stdc++.h"
using namespace std;

#ifdef LOCAL
#include "debug.h"
#else
#define debug(...)
#endif

using ll = long long;
using pii = pair<int, int>;

#define F first
#define S second
#define sz(x) (int)((x).size())
#define all(x) (x).begin(), (x).end()

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll get_rand(ll l, ll r) {
    assert(l <= r);
    return uniform_int_distribution<ll> (l, r)(rng);
}

const int N = 1e5 + 3;

struct Edge{
    int u, v;
    ll w;
    bool operator < (const Edge &o) const {
        return w < o.w;
    }
};

struct DSU{
    vector<ll> p, sz, mx;
    int comp;

    void init(int n){
        p.resize(n + 2, 0);
        sz.resize(n + 2, 0);
        mx.resize(n + 2, 0);
        comp = n;
        for(int i = 1; i <= n; ++i)
            p[i] = i, sz[i] = 1, mx[i] = 0;
    }

    int find_set(int u){
        return u == p[u] ? u : p[u] = find_set(p[u]);
    }

    ll join_sets(int u, int v, ll x, ll y){
        u = find_set(u), v = find_set(v);
        mx[u] = max(mx[u], x);
        mx[v] = max(mx[v], y);
        if(u == v)
            return 0;
        --comp;
        if(sz[u] < sz[v])
            swap(u, v);
        ll res = mx[u] + mx[v];
        p[v] = u;
        sz[u] += sz[v];
        mx[u] = max(mx[u], mx[v]);
        return res;
    }
} dsu;

int n;
ll a[N];
vector<Edge> e;

void solve(){
    cin >> n;
    for(int i = 1; i <= n; ++i)
        cin >> a[i];
    for(int i = 1; i < n; ++i){
        int u, v;
        cin >> u >> v;
        ll w = max(a[u], a[v]);
        e.push_back({u, v, w});
    }
    sort(all(e));
    dsu.init(n);
    ll res = 0;
    for(auto [u, v, w] : e)
        res += dsu.join_sets(u, v, a[u], a[v]);
    cout << res;
}

int32_t main() {
    cin.tie(nullptr)->sync_with_stdio(0);
    #define task "paradigm"
    if(fopen(task".inp", "r")){
        freopen(task".inp", "r", stdin);
        freopen(task".out", "w", stdout);
    }
    int test = 1;
//    cin >> test;
    for(int i = 1; i <= test; ++i){
//        cout << "Case #" << i << ": ";
        solve();
    }
    #ifdef LOCAL
        cerr << "\n[Time]: " << 1000.0 * clock() / CLOCKS_PER_SEC << " ms.\n";
    #endif
    return 0;
}

Compilation message

sjekira.cpp: In function 'int32_t main()':
sjekira.cpp:94:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   94 |         freopen(task".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
sjekira.cpp:95:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   95 |         freopen(task".out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 5844 KB Output is correct
2 Correct 19 ms 4564 KB Output is correct
3 Correct 19 ms 4324 KB Output is correct
4 Correct 20 ms 4812 KB Output is correct
5 Correct 37 ms 7116 KB Output is correct
6 Correct 33 ms 7236 KB Output is correct
7 Correct 32 ms 6252 KB Output is correct
8 Correct 22 ms 5576 KB Output is correct
9 Correct 15 ms 3928 KB Output is correct
10 Correct 27 ms 7108 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 524 KB Output is correct
10 Correct 1 ms 528 KB Output is correct

Subtask #4
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 24 ms 5844 KB Output is correct
7 Correct 19 ms 4564 KB Output is correct
8 Correct 19 ms 4324 KB Output is correct
9 Correct 20 ms 4812 KB Output is correct
10 Correct 37 ms 7116 KB Output is correct
11 Correct 33 ms 7236 KB Output is correct
12 Correct 32 ms 6252 KB Output is correct
13 Correct 22 ms 5576 KB Output is correct
14 Correct 15 ms 3928 KB Output is correct
15 Correct 27 ms 7108 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 1 ms 524 KB Output is correct
20 Correct 1 ms 528 KB Output is correct
21 Correct 7 ms 2012 KB Output is correct
22 Correct 6 ms 1632 KB Output is correct
23 Correct 30 ms 6876 KB Output is correct
24 Correct 21 ms 4820 KB Output is correct
25 Correct 26 ms 4784 KB Output is correct
26 Correct 17 ms 3288 KB Output is correct
27 Correct 16 ms 4056 KB Output is correct
28 Correct 19 ms 5008 KB Output is correct
29 Correct 13 ms 3540 KB Output is correct
30 Correct 30 ms 7104 KB Output is correct