oj.uz

Submission #336186

# Submission time Handle Problem Language Result Execution time Memory
336186 2020-12-15T01:23:19 Z wiwiho Sjekira (COCI20_sjekira) C++14
110 / 110
 71 ms 9964 KB 
#include<bits/stdc++.h>

#define iter(a) a.begin(), a.end()
#define pll pair<ll, ll>
#define pii pair<int, int>
#define mp make_pair
#define F first
#define S second
#define lsort(a) sort(iter(a))
#define eb emplace_back
#define gsort(a) sort(iter(a), greater<>());

using namespace std;

typedef long long ll;

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);

    int n;
    cin >> n;

    vector<pll> a(n);
    for(int i = 1; i <= n; i++) cin >> a[i-1].F, a[i-1].S = i;
    gsort(a);

    vector<vector<int>> g(n + 1);
    vector<int> deg(n + 1);
    for(int i = 1; i < n; i++){
        int u, v;
        cin >> u >> v;
        g[u].eb(v);
        g[v].eb(u);
        deg[u]++; deg[v]++;
    }

    ll ans = 0;
    for(int i = 0; i < n; i++){
        ans += a[i].F * deg[a[i].S];
        if(i) ans += a[i].F;
        for(int j : g[a[i].S]) deg[j]--;
    }

    cout << ans << "\n";

    return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 492 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 0 ms 364 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 52 ms 8044 KB Output is correct
2 Correct 37 ms 6252 KB Output is correct
3 Correct 35 ms 5996 KB Output is correct
4 Correct 38 ms 6764 KB Output is correct
5 Correct 62 ms 9836 KB Output is correct
6 Correct 46 ms 9836 KB Output is correct
7 Correct 44 ms 8684 KB Output is correct
8 Correct 37 ms 7936 KB Output is correct
9 Correct 27 ms 5228 KB Output is correct
10 Correct 66 ms 9836 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 492 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 0 ms 364 KB Output is correct
6 Correct 1 ms 492 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 492 KB Output is correct

Subtask #4
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 492 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 0 ms 364 KB Output is correct
6 Correct 52 ms 8044 KB Output is correct
7 Correct 37 ms 6252 KB Output is correct
8 Correct 35 ms 5996 KB Output is correct
9 Correct 38 ms 6764 KB Output is correct
10 Correct 62 ms 9836 KB Output is correct
11 Correct 46 ms 9836 KB Output is correct
12 Correct 44 ms 8684 KB Output is correct
13 Correct 37 ms 7936 KB Output is correct
14 Correct 27 ms 5228 KB Output is correct
15 Correct 66 ms 9836 KB Output is correct
16 Correct 1 ms 492 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 492 KB Output is correct
21 Correct 14 ms 2540 KB Output is correct
22 Correct 12 ms 2156 KB Output is correct
23 Correct 69 ms 9452 KB Output is correct
24 Correct 44 ms 6892 KB Output is correct
25 Correct 43 ms 6784 KB Output is correct
26 Correct 27 ms 4588 KB Output is correct
27 Correct 32 ms 5428 KB Output is correct
28 Correct 50 ms 6892 KB Output is correct
29 Correct 34 ms 4844 KB Output is correct
30 Correct 71 ms 9964 KB Output is correct