oj.uz

Submission #630165

# Submission time Handle Problem Language Result Execution time Memory
630165 2022-08-15T19:26:38 Z Hacv16 Sjekira (COCI20_sjekira) C++17
0 / 110
 79 ms 54412 KB 
#include<bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;

const int MAX = 2e6 + 15;
const int INF = 0x3f3f3f3f;
const int MOD = 1e9 + 7;

#define pb push_back
#define sz(x) (int) x.size()
#define fr first
#define sc second
#define mp make_pair
#define all(x) x.begin(), x.end()
#define dbg(x) cerr << #x << ": " << "[ " << x << " ]\n"

ll n, t[MAX], pai[MAX], mx[MAX], sze[MAX], ans;
vector<int> adj[MAX];

ll find(ll u){
    if(pai[u] == u) return u;
    return pai[u] = find(pai[u]);
}

void join(ll u, ll v){
    u = find(u), v = find(v);
    if(u == v) return;

    if(sze[v] > sze[u]) swap(u, v);
    pai[v] = u, sze[u] += sze[v], mx[u] = max(mx[u], mx[v]);
}

ll getMax(ll u){
    return mx[find(u)];
}

bool cmp(int u, int v){
    return t[u] < t[v];
}

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL); 

    cin >> n;

    for(int i = 1; i <= n; i++)
        cin >> t[i];

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

    for(int i = 1; i <= n; i++)
        sort(all(adj[i]), cmp); //not slow since tree

    for(int i = 1; i <= n; i++)
        pai[i] = i, mx[i] = t[i], sze[i] = 1;

    vector<int> order(n);
    iota(all(order), 1);
    sort(all(order), cmp);

    for(auto u : order){
        for(auto v : adj[u]){
            if(find(u) != find(v)){
                ans += getMax(u);
                ans += getMax(v);

                join(u, v);
            }
        }
    }

    cout << ans << '\n';

    return 0;
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 22 ms 47248 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 79 ms 54412 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 30.0

# Verdict Execution time Memory Grader output
1 Incorrect 22 ms 47248 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 60.0

# Verdict Execution time Memory Grader output
1 Incorrect 22 ms 47248 KB Output isn't correct
2 Halted 0 ms 0 KB -