oj.uz

Submission #336705

# Submission time Handle Problem Language Result Execution time Memory
336705 2020-12-16T12:52:01 Z neki Sjekira (COCI20_sjekira) C++14
50 / 110
 1000 ms 9964 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]){ 
            ll pv=fnd(v);
            if(pos[pv]<pos[u]) ans+=arr[u]+arr[pv], dsu[pv]=u;
            
        }
    }
    cout << ans << endl;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 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 109 ms 8428 KB Output is correct
2 Correct 83 ms 7020 KB Output is correct
3 Correct 79 ms 6892 KB Output is correct
4 Correct 89 ms 7404 KB Output is correct
5 Correct 141 ms 9800 KB Output is correct
6 Correct 115 ms 9708 KB Output is correct
7 Correct 100 ms 8812 KB Output is correct
8 Correct 91 ms 8172 KB Output is correct
9 Correct 60 ms 6380 KB Output is correct
10 Correct 115 ms 9708 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 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 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
0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 2 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 109 ms 8428 KB Output is correct
7 Correct 83 ms 7020 KB Output is correct
8 Correct 79 ms 6892 KB Output is correct
9 Correct 89 ms 7404 KB Output is correct
10 Correct 141 ms 9800 KB Output is correct
11 Correct 115 ms 9708 KB Output is correct
12 Correct 100 ms 8812 KB Output is correct
13 Correct 91 ms 8172 KB Output is correct
14 Correct 60 ms 6380 KB Output is correct
15 Correct 115 ms 9708 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 41 ms 4460 KB Output is correct
22 Correct 36 ms 4204 KB Output is correct
23 Correct 291 ms 9964 KB Output is correct
24 Correct 268 ms 7928 KB Output is correct
25 Correct 210 ms 7788 KB Output is correct
26 Correct 98 ms 6252 KB Output is correct
27 Correct 134 ms 6892 KB Output is correct
28 Execution timed out 1094 ms 8300 KB Time limit exceeded
29 Halted 0 ms 0 KB -