oj.uz

Submission #400604

# Submission time Handle Problem Language Result Execution time Memory
400604 2021-05-08T11:48:50 Z fadi57 Sjekira (COCI20_sjekira) C++14
110 / 110
 139 ms 12816 KB 
#include<bits/stdc++.h>
using namespace std;
const int mxx=1e5+10;
typedef long long ll;
int inf=1e9+10;
const int mod=1e9+7;
int a[mxx];
ll ans=0;

pair<int,int>edge[mxx];
int n;int par[mxx];
int mx[mxx];
int siz[mxx];
vector<int>adj[mxx];
void init(){
for(int i=0;i<n;i++){

    par[i]=i;
    mx[i]=a[i];
    siz[i]=1;
}

}
int fin(int node){

if(par[node]!=node){

    return par[node]=fin(par[node]);
}else{
return node;

}


}
void unit(int a,int b){

int aa=fin(a);
int bb=fin(b);
if(siz[a]>siz[b]){
    swap(a,b);
}

if(aa==bb){
    return;
}
par[aa]=bb;
//ans+=(mx[aa]+mx[bb]);
mx[bb]=max(mx[bb],mx[aa]);
return;



 }
 int active[mxx];
int main(){




cin>>n;
pair<int,int>v[n];
for(int i=0;i<n;i++){
    cin>>a[i];
    v[i]={a[i],i};
}
 for(int i=0;i<n-1;i++){
    int x,y;
    cin>>x>>y;
    x--;y--;
    adj[x].push_back(y);
    adj[y].push_back(x);
    edge[i]={x,y};

 }
 init();
 sort(v,v+n);

vector<pair<int,int>>x;
 for(int i=0;i<n;i++){

    int me=v[i].second;
    active[me]=1;
    for(auto it:adj[me]){

        if(active[it]){
               // cout<<v[i].first<<" "<<mx[it]<<" ";
               ans+=v[i].first;
               ans+=mx[fin(it)];
        }


    }

    for(auto it:adj[me]){

        if(active[it]){
              unit(it,me);
        }


    }

}

///cout<<endl;








 cout<<ans;

}

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 104 ms 9620 KB Output is correct
2 Correct 82 ms 8004 KB Output is correct
3 Correct 77 ms 7776 KB Output is correct
4 Correct 85 ms 8432 KB Output is correct
5 Correct 130 ms 11340 KB Output is correct
6 Correct 115 ms 12816 KB Output is correct
7 Correct 103 ms 11180 KB Output is correct
8 Correct 90 ms 10564 KB Output is correct
9 Correct 60 ms 7972 KB Output is correct
10 Correct 117 ms 12476 KB Output is correct

Subtask #3
30.0 / 30.0

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

Subtask #4
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2636 KB Output is correct
2 Correct 2 ms 2636 KB Output is correct
3 Correct 2 ms 2636 KB Output is correct
4 Correct 2 ms 2636 KB Output is correct
5 Correct 2 ms 2636 KB Output is correct
6 Correct 104 ms 9620 KB Output is correct
7 Correct 82 ms 8004 KB Output is correct
8 Correct 77 ms 7776 KB Output is correct
9 Correct 85 ms 8432 KB Output is correct
10 Correct 130 ms 11340 KB Output is correct
11 Correct 115 ms 12816 KB Output is correct
12 Correct 103 ms 11180 KB Output is correct
13 Correct 90 ms 10564 KB Output is correct
14 Correct 60 ms 7972 KB Output is correct
15 Correct 117 ms 12476 KB Output is correct
16 Correct 3 ms 2636 KB Output is correct
17 Correct 4 ms 2636 KB Output is correct
18 Correct 3 ms 2636 KB Output is correct
19 Correct 3 ms 2672 KB Output is correct
20 Correct 4 ms 2764 KB Output is correct
21 Correct 31 ms 4616 KB Output is correct
22 Correct 27 ms 4292 KB Output is correct
23 Correct 134 ms 10964 KB Output is correct
24 Correct 100 ms 8532 KB Output is correct
25 Correct 92 ms 8588 KB Output is correct
26 Correct 60 ms 6604 KB Output is correct
27 Correct 70 ms 7244 KB Output is correct
28 Correct 94 ms 8644 KB Output is correct
29 Correct 62 ms 6724 KB Output is correct
30 Correct 139 ms 11416 KB Output is correct