oj.uz

Submission #863837

# Submission time Handle Problem Language Result Execution time Memory
863837 2023-10-21T08:47:22 Z vjudge1 Sjekira (COCI20_sjekira) C++17
110 / 110
 41 ms 13456 KB 
#include<bits/stdc++.h>
#define fi first
#define se second
using namespace std;
using ll=long long;
int n;
pair<int,int> w[100005];
vector<int>v[100005];
bool cmp(pair<int,int>a,pair<int,int>b)
{
    return a.fi<b.fi;
}
int pa[100005],ma[100005],sz[1000005];
int findd(int u)
{
    if(pa[u]!=u) pa[u]=findd(pa[u]);
    return pa[u];
}
ll ans=0;
void uni(int a,int b)
{
    a=findd(a);b=findd(b);
    //cout<<a<<" "<<b<<endl;
    if(a!=b)
    {
        if(sz[a]>sz[b]) swap(a,b);
        pa[a]=b;
        sz[b]+=sz[a];
        ans=(ans+ma[a]+ma[b]);
        ma[b]=max(ma[b],ma[a]);
    }
}
bool t[100005];
int main()
{
    cin.tie(0)->sync_with_stdio(0);
    //freopen(".inp","r",stdin);
    //freopen(".out","w",stdout);
    cin>>n;
    for(int i=1;i<=n;i++) cin>>w[i].fi;
    for(int i=1;i<=n;i++) w[i].se=i;
    for(int i=1;i<n;i++)
    {
        int x,y;cin>>x>>y;
        v[x].push_back(y);
        v[y].push_back(x);
    }
    for(int i=1;i<=n;i++) ma[i]=w[i].fi;
    sort(w+1,w+n+1,cmp);
    for(int i=1;i<=n;i++) pa[i]=i,sz[i]=1;
    t[w[1].se]=true;
    for(int i=2;i<=n;i++)
        {
            for(int j:v[w[i].se]) if(t[j]) uni(w[i].se,j);
            t[w[i].se]=true;
        }
    cout<<ans;
    return 0;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 12396 KB Output is correct
2 Correct 24 ms 11092 KB Output is correct
3 Correct 24 ms 10992 KB Output is correct
4 Correct 27 ms 11348 KB Output is correct
5 Correct 41 ms 13396 KB Output is correct
6 Correct 32 ms 13392 KB Output is correct
7 Correct 28 ms 12616 KB Output is correct
8 Correct 25 ms 12112 KB Output is correct
9 Correct 19 ms 10588 KB Output is correct
10 Correct 32 ms 13396 KB Output is correct

Subtask #3
30.0 / 30.0

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

Subtask #4
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 5212 KB Output is correct
2 Correct 1 ms 5208 KB Output is correct
3 Correct 1 ms 5212 KB Output is correct
4 Correct 1 ms 5212 KB Output is correct
5 Correct 1 ms 5212 KB Output is correct
6 Correct 32 ms 12396 KB Output is correct
7 Correct 24 ms 11092 KB Output is correct
8 Correct 24 ms 10992 KB Output is correct
9 Correct 27 ms 11348 KB Output is correct
10 Correct 41 ms 13396 KB Output is correct
11 Correct 32 ms 13392 KB Output is correct
12 Correct 28 ms 12616 KB Output is correct
13 Correct 25 ms 12112 KB Output is correct
14 Correct 19 ms 10588 KB Output is correct
15 Correct 32 ms 13396 KB Output is correct
16 Correct 1 ms 5208 KB Output is correct
17 Correct 1 ms 5208 KB Output is correct
18 Correct 1 ms 5212 KB Output is correct
19 Correct 2 ms 5212 KB Output is correct
20 Correct 1 ms 5212 KB Output is correct
21 Correct 10 ms 8792 KB Output is correct
22 Correct 8 ms 6492 KB Output is correct
23 Correct 41 ms 13232 KB Output is correct
24 Correct 27 ms 11572 KB Output is correct
25 Correct 27 ms 11712 KB Output is correct
26 Correct 19 ms 10168 KB Output is correct
27 Correct 22 ms 10588 KB Output is correct
28 Correct 27 ms 11612 KB Output is correct
29 Correct 19 ms 10160 KB Output is correct
30 Correct 41 ms 13456 KB Output is correct