oj.uz

Submission #872132

# Submission time Handle Problem Language Result Execution time Memory
872132 2023-11-12T11:04:10 Z SalihSahin Sjekira (COCI20_sjekira) C++14
110 / 110
 42 ms 14932 KB 
#include<bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define int long long 
using namespace std;

const int N = 2e5 + 5;
const int mod = 1e9+7;
const int inf = 1e18 + 10;

vector<int> adj[N];
int par[N], mx[N];

int find(int a){
    if(a == par[a]) return a;
    return par[a] = find(par[a]);
} 

void merge(int a, int b){
    a = find(a), b = find(b);

    par[b] = a;
    mx[a] = max(mx[a], mx[b]);
}

int32_t main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    int n;
    cin>>n;
    vector<pair<int, int> > val(n);
    for(int i = 0; i < n; i++){
        cin>>val[i].first;
        val[i].second = i+1;
        mx[i+1] = val[i].first;
        par[i+1] = i+1;
    }
    for(int i = 0; i < n-1; i++){
        int a, b;
        cin>>a>>b;
        adj[a].pb(b);
        adj[b].pb(a);
    }
    sort(val.begin(), val.end());
    vector<int> vis(N);
    int ans = 0;

    for(auto itr: val){
        int node = itr.second;
        for(auto v: adj[node]){
            if(vis[v] && find(v) != find(node)){
                ans += (mx[find(node)] + mx[find(v)]);
                merge(v, node);
            }
        }
        vis[node] = 1;
    }

    cout<<ans<<endl;
    return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 9564 KB Output is correct
2 Correct 2 ms 9564 KB Output is correct
3 Correct 2 ms 9564 KB Output is correct
4 Correct 2 ms 9564 KB Output is correct
5 Correct 2 ms 9576 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 13656 KB Output is correct
2 Correct 24 ms 12636 KB Output is correct
3 Correct 24 ms 12624 KB Output is correct
4 Correct 26 ms 12892 KB Output is correct
5 Correct 38 ms 14504 KB Output is correct
6 Correct 29 ms 14420 KB Output is correct
7 Correct 27 ms 13760 KB Output is correct
8 Correct 24 ms 13396 KB Output is correct
9 Correct 16 ms 12120 KB Output is correct
10 Correct 30 ms 14428 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 9564 KB Output is correct
2 Correct 2 ms 9564 KB Output is correct
3 Correct 2 ms 9564 KB Output is correct
4 Correct 2 ms 9564 KB Output is correct
5 Correct 2 ms 9576 KB Output is correct
6 Correct 4 ms 9564 KB Output is correct
7 Correct 2 ms 9564 KB Output is correct
8 Correct 2 ms 9564 KB Output is correct
9 Correct 3 ms 9564 KB Output is correct
10 Correct 3 ms 9564 KB Output is correct

Subtask #4
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 9564 KB Output is correct
2 Correct 2 ms 9564 KB Output is correct
3 Correct 2 ms 9564 KB Output is correct
4 Correct 2 ms 9564 KB Output is correct
5 Correct 2 ms 9576 KB Output is correct
6 Correct 31 ms 13656 KB Output is correct
7 Correct 24 ms 12636 KB Output is correct
8 Correct 24 ms 12624 KB Output is correct
9 Correct 26 ms 12892 KB Output is correct
10 Correct 38 ms 14504 KB Output is correct
11 Correct 29 ms 14420 KB Output is correct
12 Correct 27 ms 13760 KB Output is correct
13 Correct 24 ms 13396 KB Output is correct
14 Correct 16 ms 12120 KB Output is correct
15 Correct 30 ms 14428 KB Output is correct
16 Correct 4 ms 9564 KB Output is correct
17 Correct 2 ms 9564 KB Output is correct
18 Correct 2 ms 9564 KB Output is correct
19 Correct 3 ms 9564 KB Output is correct
20 Correct 3 ms 9564 KB Output is correct
21 Correct 11 ms 11096 KB Output is correct
22 Correct 9 ms 10844 KB Output is correct
23 Correct 41 ms 14740 KB Output is correct
24 Correct 29 ms 13392 KB Output is correct
25 Correct 28 ms 13316 KB Output is correct
26 Correct 20 ms 12124 KB Output is correct
27 Correct 23 ms 12636 KB Output is correct
28 Correct 35 ms 13668 KB Output is correct
29 Correct 21 ms 12376 KB Output is correct
30 Correct 42 ms 14932 KB Output is correct