oj.uz

Submission #922343

# Submission time Handle Problem Language Result Execution time Memory
922343 2024-02-05T12:26:05 Z Shayan86 Sjekira (COCI20_sjekira) C++14
110 / 110
 27 ms 3168 KB 
#include <bits/stdc++.h>
using namespace std;

#pragma GCC optimize("O3,unroll-loops")
// #pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
// Ofast, O0, O1, O2, O3, unroll-loops, fast-math, trapv

typedef long long ll;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;

#define Mp          make_pair
#define sep         ' '
#define endl        '\n'
#define F	        first
#define S	        second
#define pb          push_back
#define all(x)      (x).begin(),(x).end()
#define kill(res)	cout << res << '\n', exit(0);
#define set_dec(x)	cout << fixed << setprecision(x);
#define fast_io     ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define file_io     freopen("input.txt", "r", stdin) ; freopen("output.txt", "w", stdout);

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

const ll N = 1e5 + 50;
const ll Mod = 1e9 + 7;

ll n, t[N];

int main(){
    fast_io;

    cin >> n;

    ll res = 0, mx = 0;
    for(int i = 1; i <= n; i++){
        cin >> t[i];
        res += t[i]; mx = max(mx, t[i]);
    }
    res -= mx;

    int u, v;
    for(int i = 1; i < n; i++){
        cin >> u >> v;
        res += max(t[u], t[v]);
    }

    cout << res;

}

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 2652 KB Output is correct
2 Correct 12 ms 2188 KB Output is correct
3 Correct 13 ms 2156 KB Output is correct
4 Correct 20 ms 2260 KB Output is correct
5 Correct 27 ms 3164 KB Output is correct
6 Correct 18 ms 3164 KB Output is correct
7 Correct 17 ms 2908 KB Output is correct
8 Correct 23 ms 2652 KB Output is correct
9 Correct 10 ms 1956 KB Output is correct
10 Correct 21 ms 3168 KB Output is correct

Subtask #3
30.0 / 30.0

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

Subtask #4
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 512 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 24 ms 2652 KB Output is correct
7 Correct 12 ms 2188 KB Output is correct
8 Correct 13 ms 2156 KB Output is correct
9 Correct 20 ms 2260 KB Output is correct
10 Correct 27 ms 3164 KB Output is correct
11 Correct 18 ms 3164 KB Output is correct
12 Correct 17 ms 2908 KB Output is correct
13 Correct 23 ms 2652 KB Output is correct
14 Correct 10 ms 1956 KB Output is correct
15 Correct 21 ms 3168 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 6 ms 1124 KB Output is correct
22 Correct 4 ms 860 KB Output is correct
23 Correct 21 ms 3156 KB Output is correct
24 Correct 18 ms 2264 KB Output is correct
25 Correct 16 ms 2392 KB Output is correct
26 Correct 9 ms 1628 KB Output is correct
27 Correct 14 ms 1880 KB Output is correct
28 Correct 19 ms 2140 KB Output is correct
29 Correct 13 ms 1372 KB Output is correct
30 Correct 20 ms 3164 KB Output is correct