oj.uz

Submission #875418

# Submission time Handle Problem Language Result Execution time Memory
875418 2023-11-19T16:00:43 Z vjudge1 Sjekira (COCI20_sjekira) C++17
110 / 110
 42 ms 13140 KB 
#include<bits/stdc++.h>
using namespace std;
const int N=1e5+7;
#define int long long
#define fi first
#define se second
typedef pair<int, int> ii;
int n;
ii w[N];
vector<int> g[N];
int p[N], ma[N], sz[N], ans=0, cx[N];

int Find(int u){
    if(u==p[u]) return u;
    return p[u]=Find(p[u]);
}

void Merge(int a, int b){
    a=Find(a); b=Find(b);
    if(a!=b){
        if(sz[a]>sz[b]) swap(a, b);
        p[a]=b;
        sz[b]+=sz[a];
        ans=(ans+ma[a]+ma[b]);
        ma[b]=max(ma[b], ma[a]);
    }
}

int32_t main(){
    cin.tie(0)->sync_with_stdio(0);
    cin>>n;
    for(int i=1; i<=n; i++){
        cin>>w[i].fi;
        w[i].se=i;
    }
    for(int i=1; i<n; i++){
        int x, y;
        cin>>x>>y;
        g[x].push_back(y);
        g[y].push_back(x);
    }
    for(int i=1; i<=n; i++) ma[i]=w[i].fi;
    sort(w+1, w+n+1);
    for(int i=1; i<=n; i++){
        p[i]=i;
        sz[i]=1;
    }
    cx[w[1].se]=true;
    for(int i=2; i<=n; i++){
        for(int j: g[w[i].se]) if(cx[j]) Merge(w[i].se, j);
        cx[w[i].se]=true;
    }
    cout<<ans;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 11344 KB Output is correct
2 Correct 24 ms 10068 KB Output is correct
3 Correct 22 ms 9820 KB Output is correct
4 Correct 29 ms 10588 KB Output is correct
5 Correct 36 ms 12668 KB Output is correct
6 Correct 30 ms 12648 KB Output is correct
7 Correct 25 ms 11588 KB Output is correct
8 Correct 23 ms 11084 KB Output is correct
9 Correct 15 ms 9308 KB Output is correct
10 Correct 28 ms 12624 KB Output is correct

Subtask #3
30.0 / 30.0

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

Subtask #4
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 6488 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 1 ms 6492 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 29 ms 11344 KB Output is correct
7 Correct 24 ms 10068 KB Output is correct
8 Correct 22 ms 9820 KB Output is correct
9 Correct 29 ms 10588 KB Output is correct
10 Correct 36 ms 12668 KB Output is correct
11 Correct 30 ms 12648 KB Output is correct
12 Correct 25 ms 11588 KB Output is correct
13 Correct 23 ms 11084 KB Output is correct
14 Correct 15 ms 9308 KB Output is correct
15 Correct 28 ms 12624 KB Output is correct
16 Correct 2 ms 6492 KB Output is correct
17 Correct 1 ms 6672 KB Output is correct
18 Correct 2 ms 6492 KB Output is correct
19 Correct 1 ms 6492 KB Output is correct
20 Correct 1 ms 6492 KB Output is correct
21 Correct 10 ms 8028 KB Output is correct
22 Correct 8 ms 7772 KB Output is correct
23 Correct 41 ms 12868 KB Output is correct
24 Correct 27 ms 10832 KB Output is correct
25 Correct 26 ms 10844 KB Output is correct
26 Correct 18 ms 9296 KB Output is correct
27 Correct 22 ms 9812 KB Output is correct
28 Correct 42 ms 10892 KB Output is correct
29 Correct 26 ms 9296 KB Output is correct
30 Correct 38 ms 13140 KB Output is correct