oj.uz

Submission #336710

# Submission time Handle Problem Language Result Execution time Memory
336710 2020-12-16T13:04:10 Z neki Sjekira (COCI20_sjekira) C++14
110 / 110
 151 ms 13292 KB 
#include <bits/stdc++.h>
#define loop(i, a, b) for(long long i=a;i<b;i++)
#define pool(i, a, b) for(long long i=a-1;i>=b;i--)
#define fore(i, a) for(auto&& i:a)
#define fi first
#define se second
#define ps(a) push_back(a)
#define pb(a) pop_back(a)
#define sc scanf
#define vc vector
#define ll long long
#define lb lower_bound
#define ub upper_bound
#define all(a) a.begin(), a.end()
#define llmax LLONG_MAX/2
#define llmin -LLONG_MAX/2
using namespace std;
#define mn 101000
#define par pair<ll, ll>
#define ld long double
#define mod 1000000007
ll arr[mn], dsu[mn], pos[mn], lar[mn], siz[mn];
par srt[mn];
vc<ll> edg[mn];
ll fnd(ll u){return (u==dsu[u]) ? u:fnd(dsu[u]);}
int main() {
    ll n;cin >> n;
    loop(i, 1, n+1) cin >> arr[i];
    loop(i, 1, n+1) srt[i].fi=arr[i], srt[i].se=i, dsu[i]=i, siz[i]=1;
    sort(srt+1, srt+n+1);
    loop(i, 1, n+1) lar[srt[i].se]=i;
    loop(i, 0, n-1){
        ll a, b;cin >> a >> b;
        edg[a].ps(b);
        edg[b].ps(a);
    }

    ll ans=0;
    loop(i, 1, n+1){
        ll u=srt[i].se;
        fore(v, edg[u]){ 
            ll pv=fnd(v),  pu=fnd(u);
            if(lar[pv]<lar[pu]){ 
                ans+=srt[lar[pu]].fi+srt[lar[pv]].fi;
                if(siz[pv]>siz[pu]) swap(pv, pu);
                dsu[pv]=pu;
                lar[pu]=max(lar[pu], lar[pv]);
                siz[pu]+=siz[pv];
            }
        }
    }
    cout << ans << endl;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 113 ms 9068 KB Output is correct
2 Correct 83 ms 7532 KB Output is correct
3 Correct 81 ms 7532 KB Output is correct
4 Correct 91 ms 7916 KB Output is correct
5 Correct 139 ms 10604 KB Output is correct
6 Correct 117 ms 10604 KB Output is correct
7 Correct 101 ms 9452 KB Output is correct
8 Correct 92 ms 8812 KB Output is correct
9 Correct 61 ms 6764 KB Output is correct
10 Correct 117 ms 10620 KB Output is correct

Subtask #3
30.0 / 30.0

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

Subtask #4
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2680 KB Output is correct
2 Correct 2 ms 2668 KB Output is correct
3 Correct 2 ms 2668 KB Output is correct
4 Correct 3 ms 2668 KB Output is correct
5 Correct 2 ms 2668 KB Output is correct
6 Correct 113 ms 9068 KB Output is correct
7 Correct 83 ms 7532 KB Output is correct
8 Correct 81 ms 7532 KB Output is correct
9 Correct 91 ms 7916 KB Output is correct
10 Correct 139 ms 10604 KB Output is correct
11 Correct 117 ms 10604 KB Output is correct
12 Correct 101 ms 9452 KB Output is correct
13 Correct 92 ms 8812 KB Output is correct
14 Correct 61 ms 6764 KB Output is correct
15 Correct 117 ms 10620 KB Output is correct
16 Correct 3 ms 2796 KB Output is correct
17 Correct 3 ms 2796 KB Output is correct
18 Correct 3 ms 2796 KB Output is correct
19 Correct 3 ms 2796 KB Output is correct
20 Correct 3 ms 2796 KB Output is correct
21 Correct 33 ms 4716 KB Output is correct
22 Correct 26 ms 4332 KB Output is correct
23 Correct 151 ms 10732 KB Output is correct
24 Correct 101 ms 8428 KB Output is correct
25 Correct 101 ms 8428 KB Output is correct
26 Correct 65 ms 6508 KB Output is correct
27 Correct 89 ms 7276 KB Output is correct
28 Correct 100 ms 8812 KB Output is correct
29 Correct 67 ms 7660 KB Output is correct
30 Correct 150 ms 13292 KB Output is correct