oj.uz

Submission #529019

# Submission time Handle Problem Language Result Execution time Memory
529019 2022-02-22T00:51:23 Z beepbeepsheep Sjekira (COCI20_sjekira) C++17
110 / 110
 99 ms 16532 KB 
#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define ii pair<ll,ll>
//#define endl '\n'
const ll inf=1e15;
const ll mod=1e9+7;
const ll maxn=1e5+5;
ll par[maxn];
multiset<ii> adj[maxn];
priority_queue<ii,vector<ii>,greater<ii>> pq;
ll arr[maxn];
ll root(ll x){
    if (par[x]==x) return x;
    return par[x]=root(par[x]);
}
void connect(ll a, ll b){
    ll pa=root(a),pb=root(b);
    if (pa==pb) return;
    par[pa]=pb;
    if (adj[pa].size()>adj[pb].size()) swap(adj[pa],adj[pb]);
    for (auto u:adj[pa]) adj[pb].emplace(u);
    adj[pa].clear();
}
int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    ll n,ele,a,b;
    cin>>n;
    for (int i=0;i<n;i++){
        par[i+1]=i+1;
        cin>>ele;
        arr[i+1]=ele;
        pq.emplace(ele,i+1);
    }
    for (int i=0;i<n-1;i++){
        cin>>a>>b;
        if (arr[a]>arr[b] || (arr[a]==arr[b] && a>b)) swap(a,b);
        adj[a].emplace(arr[b],b);
    }
    ll ans=0,c;
    while (pq.size()!=1){
        a=pq.top().first;
        b=pq.top().second;
        pq.pop();
        ans+=a+(adj[b].begin()->first);
        c=adj[b].begin()->second;
        adj[b].erase(adj[b].begin());
        connect(b,c);
    }
    cout<<ans;
    return 0;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 58 ms 14364 KB Output is correct
2 Correct 43 ms 12096 KB Output is correct
3 Correct 38 ms 11868 KB Output is correct
4 Correct 46 ms 12656 KB Output is correct
5 Correct 72 ms 16428 KB Output is correct
6 Correct 44 ms 16416 KB Output is correct
7 Correct 38 ms 14904 KB Output is correct
8 Correct 35 ms 13972 KB Output is correct
9 Correct 23 ms 10812 KB Output is correct
10 Correct 43 ms 16532 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4940 KB Output is correct
2 Correct 3 ms 4940 KB Output is correct
3 Correct 4 ms 4940 KB Output is correct
4 Correct 3 ms 5024 KB Output is correct
5 Correct 3 ms 4940 KB Output is correct
6 Correct 3 ms 5068 KB Output is correct
7 Correct 3 ms 5068 KB Output is correct
8 Correct 3 ms 5028 KB Output is correct
9 Correct 3 ms 5068 KB Output is correct
10 Correct 3 ms 5088 KB Output is correct

Subtask #4
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4940 KB Output is correct
2 Correct 3 ms 4940 KB Output is correct
3 Correct 4 ms 4940 KB Output is correct
4 Correct 3 ms 5024 KB Output is correct
5 Correct 3 ms 4940 KB Output is correct
6 Correct 58 ms 14364 KB Output is correct
7 Correct 43 ms 12096 KB Output is correct
8 Correct 38 ms 11868 KB Output is correct
9 Correct 46 ms 12656 KB Output is correct
10 Correct 72 ms 16428 KB Output is correct
11 Correct 44 ms 16416 KB Output is correct
12 Correct 38 ms 14904 KB Output is correct
13 Correct 35 ms 13972 KB Output is correct
14 Correct 23 ms 10812 KB Output is correct
15 Correct 43 ms 16532 KB Output is correct
16 Correct 3 ms 5068 KB Output is correct
17 Correct 3 ms 5068 KB Output is correct
18 Correct 3 ms 5028 KB Output is correct
19 Correct 3 ms 5068 KB Output is correct
20 Correct 3 ms 5088 KB Output is correct
21 Correct 17 ms 7560 KB Output is correct
22 Correct 14 ms 7220 KB Output is correct
23 Correct 90 ms 15836 KB Output is correct
24 Correct 58 ms 12756 KB Output is correct
25 Correct 56 ms 12676 KB Output is correct
26 Correct 32 ms 10120 KB Output is correct
27 Correct 38 ms 11040 KB Output is correct
28 Correct 61 ms 12976 KB Output is correct
29 Correct 35 ms 10404 KB Output is correct
30 Correct 99 ms 16424 KB Output is correct