oj.uz

답안 #646930

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
646930 2022-10-01T07:38:37 Z BackNoob Sjekira (COCI20_sjekira) C++14
110 / 110
 59 ms 14172 KB 
#pragma GCC optimize ("Ofast")
#pragma GCC target ("avx2")
#include <bits/stdc++.h>
#define ll long long
#define fi first
#define se second
#define endl '\n'
#define MASK(i) (1LL << (i))
#define ull unsigned long long
#define ld long double
#define pb push_back
#define all(x) (x).begin() , (x).end()
#define BIT(x , i) ((x >> (i)) & 1)
#define TASK "task"
#define sz(s) (int) (s).size()

using namespace std;
const int mxN = 3e5 + 227;
const int inf = 1e9 + 277;
const int mod = 1e9 + 7;
const ll infll = 1e18 + 7;
const int base = 307;
const int LOG = 20;
const int block_sz = 500;

template <typename T1, typename T2> bool minimize(T1 &a, T2 b) {
    if (a > b) {a = b; return true;} return false;
}
template <typename T1, typename T2> bool maximize(T1 &a, T2 b) {
    if (a < b) {a = b; return true;} return false;
}

struct DSU{
    int n;
    vector<int> lab;
    vector<int> mx;
    DSU(){}
    DSU(int _n)
    {
        n = _n;
        lab.resize(n + 7, -1);
        mx.resize(n + 7);
    }

    int root(int u) {return lab[u] < 0 ? u : lab[u] = root(lab[u]);}
    bool union_root(int u, int v)
    {
        u = root(u);
        v = root(v);
        if(u == v) return false;
        if(lab[u] > lab[v]) swap(u, v);
        lab[u] += lab[v];
        lab[v] = u;
        maximize(mx[u], mx[v]);
        return true;
    }
} dsu;

int n;
bool used[mxN];
pair<int, int> ed[mxN];
vector<int> adj[mxN];
int idx[mxN];
int best[mxN];

bool cmp(int a, int b)
{
    return dsu.mx[a] < dsu.mx[b];
}

void solve()
{
    cin >> n;

    dsu = DSU(n);
    for(int i = 1; i <= n; i++) cin >> dsu.mx[i];

    for(int i = 1; i <= n; i++) idx[i] = i;
    sort(idx + 1, idx + 1 + n, cmp);

    for(int i = 1; i <= n; i++) best[idx[i]] = i;

    for(int i = 1; i < n; i++) {
        int u, v;
        cin >> u >> v;
        if(best[u] < best[v]) swap(u, v);
        adj[u].pb(v);
    }


    ll res = 0;
    for(int i = 1; i <= n; i++) {
        int u = idx[i];

        for(int v : adj[u]) {
            res += dsu.mx[dsu.root(u)];
            res += dsu.mx[dsu.root(v)];
            dsu.union_root(u, v);
        }
    }



    cout << res;
}


int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    //freopen("task.inp", "r", stdin);
    //freopen("task.out", "w", stdout);

    int tc = 1;
    //cin >> tc;
    while(tc--) {
        solve();
    }
    return 0;
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 7380 KB Output is correct
2 Correct 4 ms 7380 KB Output is correct
3 Correct 4 ms 7380 KB Output is correct
4 Correct 4 ms 7380 KB Output is correct
5 Correct 4 ms 7380 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 46 ms 12060 KB Output is correct
2 Correct 35 ms 10924 KB Output is correct
3 Correct 35 ms 10720 KB Output is correct
4 Correct 37 ms 11212 KB Output is correct
5 Correct 57 ms 13164 KB Output is correct
6 Correct 41 ms 14172 KB Output is correct
7 Correct 37 ms 13168 KB Output is correct
8 Correct 33 ms 12728 KB Output is correct
9 Correct 24 ms 10800 KB Output is correct
10 Correct 40 ms 14124 KB Output is correct

Subtask #3
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 7380 KB Output is correct
2 Correct 4 ms 7380 KB Output is correct
3 Correct 4 ms 7380 KB Output is correct
4 Correct 4 ms 7380 KB Output is correct
5 Correct 4 ms 7380 KB Output is correct
6 Correct 5 ms 7380 KB Output is correct
7 Correct 5 ms 7380 KB Output is correct
8 Correct 5 ms 7388 KB Output is correct
9 Correct 5 ms 7396 KB Output is correct
10 Correct 5 ms 7412 KB Output is correct

Subtask #4
60.0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 7380 KB Output is correct
2 Correct 4 ms 7380 KB Output is correct
3 Correct 4 ms 7380 KB Output is correct
4 Correct 4 ms 7380 KB Output is correct
5 Correct 4 ms 7380 KB Output is correct
6 Correct 46 ms 12060 KB Output is correct
7 Correct 35 ms 10924 KB Output is correct
8 Correct 35 ms 10720 KB Output is correct
9 Correct 37 ms 11212 KB Output is correct
10 Correct 57 ms 13164 KB Output is correct
11 Correct 41 ms 14172 KB Output is correct
12 Correct 37 ms 13168 KB Output is correct
13 Correct 33 ms 12728 KB Output is correct
14 Correct 24 ms 10800 KB Output is correct
15 Correct 40 ms 14124 KB Output is correct
16 Correct 5 ms 7380 KB Output is correct
17 Correct 5 ms 7380 KB Output is correct
18 Correct 5 ms 7388 KB Output is correct
19 Correct 5 ms 7396 KB Output is correct
20 Correct 5 ms 7412 KB Output is correct
21 Correct 15 ms 8660 KB Output is correct
22 Correct 16 ms 8404 KB Output is correct
23 Correct 53 ms 12684 KB Output is correct
24 Correct 43 ms 11128 KB Output is correct
25 Correct 38 ms 11148 KB Output is correct
26 Correct 26 ms 9844 KB Output is correct
27 Correct 32 ms 10316 KB Output is correct
28 Correct 43 ms 11044 KB Output is correct
29 Correct 27 ms 9788 KB Output is correct
30 Correct 59 ms 12876 KB Output is correct