제출 #1111824

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1111824		ezzzay	Sjekira (COCI20_sjekira)	C++14	110 / 110	87 ms	24620 KiB

sjekira

#include<bits/stdc++.h>
using namespace std;
#define int long long
#define ff first
#define ss second
#define pb push_back
const int N=3e5+5;
int par[N],c[N],sbtr[N],mx[N];
vector<int>v[N];
int ans=0;
bool vis[N];
int find(int x){
    if(x==par[x])return x;
    return par[x]=find(par[x]);
}
void merge(int x, int y){
    int px=find(x),py=find(y);
    if(sbtr[px]<sbtr[py]){
        swap(py,px);
    }
    
    ans+=mx[px]+mx[py];
    sbtr[px]+=sbtr[py];
    mx[px]=max(mx[px],mx[py]);
    par[py]=px;
}

bool cmp(const pair<int,int> & a, const pair<int,int> & b) {
    int x = max(c[a.first], c[a.second]);
    int y = max(c[b.first], c[b.second]);
    return x<y;
}
signed main(){
    int n;
    cin>>n;
    vector<pair<int,int>>vc;
    for(int i=1;i<=n;i++){
        cin>>c[i];
        par[i]=i;
        sbtr[i]=1;
        mx[i]=c[i];
    }
    for(int i=1;i<n;i++){
        int a,b;
        cin>>a>>b;
        v[a].pb(b);
        v[b].pb(a);
        vc.pb({a,b});
    }
    sort(vc.begin(),vc.end(),cmp);
    for(auto p:vc){
        int a=p.ss;
        int b=p.ff;
        merge(a,b);
    }
    cout<<ans;
}

• Subtask 1: 10 / 10
• Subtask 2: 10 / 10
• Subtask 3: 30 / 30
• Subtask 4: 60 / 60