제출 #391262

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
391262		MrRobot_28	Sjekira (COCI20_sjekira)	C++17	40 / 110	1093 ms	8720 KiB

sjekira

#include<bits/stdc++.h>
using namespace std;
#define X first
#define Y second
#define sz(a) (int)a.size()
#define ll long long
#define ld long double
const int N = 3e5 + 100;
int dsu[N];
int val[N];
int rang[N];
int pred(int a)
{
    if(a == dsu[a]) return a;
    return dsu[a] = pred(dsu[a]);
}
void unite(int a, int b)
{
    a = pred(a);
    b = pred(b);
    if(rang[b] < rang[a])
    {
        swap(a, b);
    }
    dsu[b] = a;
    rang[a] += rang[b];
    val[a] = max(val[a], val[b]);
}
signed main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int n;
    cin >> n;
    vector <pair <int, int> > a(n);
    for(int i = 0; i < n; i++)
    {
        cin >> a[i].X;
        val[i] = a[i].X;
        a[i].Y = i;
        dsu[i] = i;
        rang[i] = 1;
    }
    sort(a.begin(), a.end());
    vector <vector <int> > g(n);
    vector <pair <int, int> > vec;
    for(int i = 0; i < n - 1; i++)
    {
        int a, b;
        cin >> a>> b;
        a--;
        b--;
        vec.push_back({a, b});
        g[a].push_back(b);
        g[b].push_back(a);
    }
    ll s = 0;
    for(int i = 0; i < n - 1; i++)
    {
        int a = -1, b = -1;
        for(int j = 0; j < n - 1; j++)
        {
            if(pred(vec[j].X) != pred(vec[j].Y) && (a == -1 || val[pred(a)] + val[pred(b)] > val[pred(vec[j].X)] + val[pred(vec[j].Y)])){
                a = vec[j].X;
                b = vec[j].Y;
            }
        }
        s += val[pred(a)] + val[pred(b)];
        unite(a, b);
    }
    cout << s;
    return 0;
}

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