oj.uz

Submission #374298

# Submission time Handle Problem Language Result Execution time Memory
374298 2021-03-07T07:14:26 Z ne4eHbKa Sjekira (COCI20_sjekira) C++17
110 / 110
 82 ms 10604 KB 
#include <bits/stdc++.h>
using namespace std;
#ifndef _LOCAL
//#pragma GCC optimize("O3,Ofast")
#else
#pragma GCC optimize("O0")
#endif
template<typename t> inline void umin(t &a, const t b) {a = min(a, b);}
template<typename t> inline void umax(t &a, const t b) {a = max(a, b);}
typedef pair<int, int> pii;
typedef long long ll;
typedef long double ld;
typedef int8_t byte;
ll time() {return chrono::system_clock().now().time_since_epoch().count();}
mt19937 rnd(time());
#define ft first
#define sd second
#define len(f) int((f).size())
#define bnd(f) (f).begin(), (f).end()
#define _ <<' '<<
const int inf = 1e9 + 5;
const ll inf64 = 4e18 + 5;
const int md = 998244353;
namespace MD {
    void add(int &a, const int b) {if((a += b) >= md) a -= md;}
    void sub(int &a, const int b) {if((a -= b) < 0) a += md;}
    int prod(const int a, const int b) {return ll(a) * b % md;}
};

int n;
const int N = 1e5 + 5;
vector<int> g[N];
int t[N];
ll ans;
int p[N], f[N];
int get(int i) {return p[i] == i ? i : p[i] = get(p[i]);}
void unite(int i, int j) {p[i = get(i)] = j = get(j); umax(t[j], t[i]);}

void solve() {
    cin >> n;
    iota(p, p + n, 0);
    for(int i = 0; i < n; ++i) g[i].clear();
    iota(f, f + n, 0);
    for(int i = 0; i < n; ++i) cin >> t[i];
    for(int i = 1; i < n; ++i) {
        int x, y;
        cin >> x >> y;
        --x, --y;
        g[x].push_back(y);
        g[y].push_back(x);
    }
    sort(f, f + n, [&] (const int &a, const int &b) {return t[a] < t[b];});
    ans = 0;
    for(int i = 0; i < n; ++i) {
        int v = f[i];
        for(int u : g[v]) {
            if(t[u] > t[v]) continue;
            if(get(u) != get(v)) {
                ans += t[get(u)] + t[get(v)];
                unite(u, v);
            }
        }
    }
    cout << ans << endl;
}

signed main() {
    ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#ifndef _LOCAL
//    freopen("file.in", "r", stdin);
//    freopen("file.out", "w", stdout);
#else
    system("color a");
    freopen("in.txt", "r", stdin);
    int t; cin >> t;
    while(t--)
#endif
    solve();
}

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 53 ms 7916 KB Output is correct
2 Correct 55 ms 6740 KB Output is correct
3 Correct 38 ms 6508 KB Output is correct
4 Correct 49 ms 7020 KB Output is correct
5 Correct 67 ms 9204 KB Output is correct
6 Correct 47 ms 10604 KB Output is correct
7 Correct 41 ms 9088 KB Output is correct
8 Correct 38 ms 8812 KB Output is correct
9 Correct 27 ms 6892 KB Output is correct
10 Correct 47 ms 10348 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 3 ms 2668 KB Output is correct
3 Correct 3 ms 2668 KB Output is correct
4 Correct 3 ms 2668 KB Output is correct
5 Correct 3 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
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 2668 KB Output is correct
2 Correct 3 ms 2668 KB Output is correct
3 Correct 3 ms 2668 KB Output is correct
4 Correct 3 ms 2668 KB Output is correct
5 Correct 3 ms 2668 KB Output is correct
6 Correct 53 ms 7916 KB Output is correct
7 Correct 55 ms 6740 KB Output is correct
8 Correct 38 ms 6508 KB Output is correct
9 Correct 49 ms 7020 KB Output is correct
10 Correct 67 ms 9204 KB Output is correct
11 Correct 47 ms 10604 KB Output is correct
12 Correct 41 ms 9088 KB Output is correct
13 Correct 38 ms 8812 KB Output is correct
14 Correct 27 ms 6892 KB Output is correct
15 Correct 47 ms 10348 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 16 ms 4204 KB Output is correct
22 Correct 14 ms 3948 KB Output is correct
23 Correct 76 ms 8956 KB Output is correct
24 Correct 51 ms 7148 KB Output is correct
25 Correct 51 ms 7020 KB Output is correct
26 Correct 36 ms 5612 KB Output is correct
27 Correct 37 ms 6144 KB Output is correct
28 Correct 55 ms 7288 KB Output is correct
29 Correct 35 ms 5612 KB Output is correct
30 Correct 82 ms 9248 KB Output is correct