oj.uz

Submission #329877

# Submission time Handle Problem Language Result Execution time Memory
329877 2020-11-23T01:32:44 Z 534351 Sjekira (COCI20_sjekira) C++17
110 / 110
 59 ms 8428 KB 
#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>

using namespace std;
// using namespace __gnu_pbds;

// template<class T>
// using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

template<class T, class U>
void ckmin(T &a, U b)
{
    if (a > b) a = b;
}

template<class T, class U>
void ckmax(T &a, U b)
{
    if (a < b) a = b;
}

#define MP make_pair
#define PB push_back
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define SZ(x) ((int) (x).size())
#define ALL(x) (x).begin(), (x).end()
#define FOR(i, a, b) for (auto i = (a); i < (b); i++)
#define FORD(i, a, b) for (auto i = (a) - 1; i >= (b); i--)

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<pii> vpi;
typedef vector<pll> vpl;

const int MAXN = 1e5 + 13;

int N;
int arr[MAXN];
vi edge[MAXN];
ll mx;
ll ans;

int32_t main()
{
    cout << fixed << setprecision(12);
    cerr << fixed << setprecision(4);
    ios_base::sync_with_stdio(false); cin.tie(0);
    cin >> N;
    FOR(i, 0, N)
    {
        cin >> arr[i];
        ans += arr[i];
        ckmax(mx, arr[i]);
    }
    FOR(i, 0, N - 1)
    {
        int u, v;
        cin >> u >> v; u--; v--;
        edge[u].PB(v);
        edge[v].PB(u);
        ans += max(arr[u], arr[v]);
    }
    ans -= mx;
    cout << ans << '\n';
    return 0;
}

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 34 ms 7276 KB Output is correct
2 Correct 26 ms 6124 KB Output is correct
3 Correct 25 ms 6124 KB Output is correct
4 Correct 30 ms 6508 KB Output is correct
5 Correct 41 ms 8300 KB Output is correct
6 Correct 41 ms 8300 KB Output is correct
7 Correct 35 ms 7532 KB Output is correct
8 Correct 32 ms 7148 KB Output is correct
9 Correct 26 ms 5612 KB Output is correct
10 Correct 47 ms 8428 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 2 ms 2668 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 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 34 ms 7276 KB Output is correct
7 Correct 26 ms 6124 KB Output is correct
8 Correct 25 ms 6124 KB Output is correct
9 Correct 30 ms 6508 KB Output is correct
10 Correct 41 ms 8300 KB Output is correct
11 Correct 41 ms 8300 KB Output is correct
12 Correct 35 ms 7532 KB Output is correct
13 Correct 32 ms 7148 KB Output is correct
14 Correct 26 ms 5612 KB Output is correct
15 Correct 47 ms 8428 KB Output is correct
16 Correct 3 ms 2796 KB Output is correct
17 Correct 3 ms 2796 KB Output is correct
18 Correct 2 ms 2668 KB Output is correct
19 Correct 3 ms 2796 KB Output is correct
20 Correct 3 ms 2796 KB Output is correct
21 Correct 12 ms 4076 KB Output is correct
22 Correct 12 ms 3964 KB Output is correct
23 Correct 59 ms 8136 KB Output is correct
24 Correct 34 ms 6508 KB Output is correct
25 Correct 34 ms 6508 KB Output is correct
26 Correct 25 ms 5228 KB Output is correct
27 Correct 26 ms 5740 KB Output is correct
28 Correct 38 ms 6508 KB Output is correct
29 Correct 25 ms 5228 KB Output is correct
30 Correct 55 ms 8428 KB Output is correct