oj.uz

Submission #336704

# Submission time Handle Problem Language Result Execution time Memory
336704 2020-12-16T12:50:46 Z neki Sjekira (COCI20_sjekira) C++14
50 / 110
 1000 ms 12140 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];
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;
    sort(srt+1, srt+n+1);
    loop(i, 1, n+1) pos[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]) if(pos[fnd(v)]<pos[u]) ans+=arr[u]+arr[fnd(v)], dsu[fnd(v)]=u;
    }
    cout << ans << endl;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 2668 KB Output is correct
2 Correct 2 ms 2668 KB Output is correct
3 Correct 2 ms 2668 KB Output is correct
4 Correct 2 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 122 ms 10220 KB Output is correct
2 Correct 82 ms 8300 KB Output is correct
3 Correct 79 ms 8172 KB Output is correct
4 Correct 92 ms 8812 KB Output is correct
5 Correct 139 ms 11884 KB Output is correct
6 Correct 118 ms 11884 KB Output is correct
7 Correct 104 ms 10604 KB Output is correct
8 Correct 93 ms 9964 KB Output is correct
9 Correct 61 ms 7404 KB Output is correct
10 Correct 117 ms 11884 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 2668 KB Output is correct
2 Correct 2 ms 2668 KB Output is correct
3 Correct 2 ms 2668 KB Output is correct
4 Correct 2 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 2816 KB Output is correct
8 Correct 3 ms 2796 KB Output is correct
9 Correct 3 ms 2796 KB Output is correct
10 Correct 4 ms 2796 KB Output is correct

Subtask #4
0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 2668 KB Output is correct
2 Correct 2 ms 2668 KB Output is correct
3 Correct 2 ms 2668 KB Output is correct
4 Correct 2 ms 2668 KB Output is correct
5 Correct 2 ms 2668 KB Output is correct
6 Correct 122 ms 10220 KB Output is correct
7 Correct 82 ms 8300 KB Output is correct
8 Correct 79 ms 8172 KB Output is correct
9 Correct 92 ms 8812 KB Output is correct
10 Correct 139 ms 11884 KB Output is correct
11 Correct 118 ms 11884 KB Output is correct
12 Correct 104 ms 10604 KB Output is correct
13 Correct 93 ms 9964 KB Output is correct
14 Correct 61 ms 7404 KB Output is correct
15 Correct 117 ms 11884 KB Output is correct
16 Correct 3 ms 2796 KB Output is correct
17 Correct 3 ms 2816 KB Output is correct
18 Correct 3 ms 2796 KB Output is correct
19 Correct 3 ms 2796 KB Output is correct
20 Correct 4 ms 2796 KB Output is correct
21 Correct 57 ms 4972 KB Output is correct
22 Correct 50 ms 4588 KB Output is correct
23 Correct 559 ms 12140 KB Output is correct
24 Correct 562 ms 9452 KB Output is correct
25 Correct 453 ms 9452 KB Output is correct
26 Correct 157 ms 7148 KB Output is correct
27 Correct 241 ms 7916 KB Output is correct
28 Execution timed out 1097 ms 9324 KB Time limit exceeded
29 Halted 0 ms 0 KB -