oj.uz

Submission #445482

# Submission time Handle Problem Language Result Execution time Memory
445482 2021-07-18T08:50:32 Z grt Sjekira (COCI20_sjekira) C++17
50 / 110
 74 ms 9828 KB 
#include <bits/stdc++.h>
#define ST first
#define ND second
#define PB push_back

using namespace std;
using ll = long long;
using pi = pair<int,int>;
using vi = vector<int>;

const int nax = 100 * 1000 + 10;
int n;
pi val[nax];
int par[nax], siz[nax], mx[nax];
vi V[nax];

int Fund(int x) {
	if(par[x] != x) par[x] = Fund(par[x]);
	return par[x];
}

void Onion(int a, int b) {
	a = Fund(a); b = Fund(b);
	if(a == b) return;
	if(siz[a] < siz[b]) swap(a, b);
	siz[a] += siz[b];
	mx[a] = max(mx[a], mx[b]);
	par[b] = a;
}

ll ans;

int main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cin >> n;
	for(int i = 1; i <= n; ++i) {
		par[i] = i;
		siz[i] = 1;
		cin >> mx[i];
		val[i] = {mx[i], i};
	}
	for(int a,b,i = 1; i < n; ++i) {
		cin >> a >> b;
		V[a].PB(b);
		V[b].PB(a);
	}
	sort(val + 1, val + n + 1);
	for(int i = 1; i <= n; ++i) {
		int u = val[i].ND;
		for(auto nbh : V[u]) {
			if(mx[Fund(nbh)] < val[i].ST || (mx[Fund(nbh)] == val[i].ST && u > nbh)) {
				ans += val[i].ST;
				ans += mx[Fund(nbh)];
				Onion(nbh, u);
			}
		}
	}
	cout << ans;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 52 ms 6796 KB Output is correct
2 Correct 38 ms 5756 KB Output is correct
3 Correct 38 ms 5652 KB Output is correct
4 Correct 40 ms 5960 KB Output is correct
5 Correct 63 ms 7732 KB Output is correct
6 Correct 48 ms 7676 KB Output is correct
7 Correct 41 ms 8872 KB Output is correct
8 Correct 37 ms 8288 KB Output is correct
9 Correct 25 ms 6352 KB Output is correct
10 Correct 49 ms 9828 KB Output is correct

Subtask #3
30.0 / 30.0

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

Subtask #4
0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2636 KB Output is correct
2 Correct 2 ms 2636 KB Output is correct
3 Correct 2 ms 2636 KB Output is correct
4 Correct 2 ms 2636 KB Output is correct
5 Correct 2 ms 2636 KB Output is correct
6 Correct 52 ms 6796 KB Output is correct
7 Correct 38 ms 5756 KB Output is correct
8 Correct 38 ms 5652 KB Output is correct
9 Correct 40 ms 5960 KB Output is correct
10 Correct 63 ms 7732 KB Output is correct
11 Correct 48 ms 7676 KB Output is correct
12 Correct 41 ms 8872 KB Output is correct
13 Correct 37 ms 8288 KB Output is correct
14 Correct 25 ms 6352 KB Output is correct
15 Correct 49 ms 9828 KB Output is correct
16 Correct 2 ms 2636 KB Output is correct
17 Correct 2 ms 2636 KB Output is correct
18 Correct 2 ms 2636 KB Output is correct
19 Correct 3 ms 2636 KB Output is correct
20 Correct 2 ms 2636 KB Output is correct
21 Correct 17 ms 4300 KB Output is correct
22 Correct 16 ms 4024 KB Output is correct
23 Correct 74 ms 9520 KB Output is correct
24 Correct 50 ms 7492 KB Output is correct
25 Correct 46 ms 7496 KB Output is correct
26 Correct 29 ms 5828 KB Output is correct
27 Correct 35 ms 6384 KB Output is correct
28 Incorrect 55 ms 7524 KB Output isn't correct
29 Halted 0 ms 0 KB -