oj.uz

Submission #858460

# Submission time Handle Problem Language Result Execution time Memory
858460 2023-10-08T13:58:19 Z serifefedartar Sjekira (COCI20_sjekira) C++17
110 / 110
 38 ms 6360 KB 
#include <bits/stdc++.h>
using namespace std;
 
#define fast ios::sync_with_stdio(0);cin.tie(0);
#define s second
#define f first
typedef long long ll;
const ll MOD = 998244353;
const ll LOGN = 18; 
const ll INF = 1e15;
const ll MAXN = 1e5 + 5;

vector<pair<ll,pair<int,int>>> edge;
ll t[MAXN];
int par[MAXN], sz[MAXN], mx[MAXN];
int find(int node) {
	if (node == par[node])
		return node;
	return par[node] = find(par[node]);
}

void unite(int a, int b) {
	a = find(a);
	b = find(b);
	if (sz[a] < sz[b])
		swap(a, b);
	mx[a] = max(mx[a], mx[b]);
	par[b] = a;
	sz[a] += sz[b];
}

int main() {
	fast
	int n, a, b;
	cin >> n;

	for (int i = 1; i <= n; i++)
		cin >> t[i];
	for (int i = 1; i <= n; i++)
		par[i] = i, sz[i] = 1, mx[i] = t[i];

	for (int i = 1; i < n; i++) {
		cin >> a >> b;
		edge.push_back({max(t[a], t[b]), {a, b}});
	}
	sort(edge.begin(), edge.end());

	ll ans = 0;
	for (auto u : edge) {
		int x = find(u.s.f);
		int y = find(u.s.s);
		ans += mx[x] + mx[y];
		unite(x, y); 
	}
	cout << ans << "\n";
}

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 5808 KB Output is correct
2 Correct 19 ms 4056 KB Output is correct
3 Correct 18 ms 3804 KB Output is correct
4 Correct 20 ms 5332 KB Output is correct
5 Correct 30 ms 6348 KB Output is correct
6 Correct 27 ms 6360 KB Output is correct
7 Correct 23 ms 6140 KB Output is correct
8 Correct 28 ms 5840 KB Output is correct
9 Correct 14 ms 3544 KB Output is correct
10 Correct 26 ms 6352 KB Output is correct

Subtask #3
30.0 / 30.0

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

Subtask #4
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 31 ms 5808 KB Output is correct
7 Correct 19 ms 4056 KB Output is correct
8 Correct 18 ms 3804 KB Output is correct
9 Correct 20 ms 5332 KB Output is correct
10 Correct 30 ms 6348 KB Output is correct
11 Correct 27 ms 6360 KB Output is correct
12 Correct 23 ms 6140 KB Output is correct
13 Correct 28 ms 5840 KB Output is correct
14 Correct 14 ms 3544 KB Output is correct
15 Correct 26 ms 6352 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 1 ms 488 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 476 KB Output is correct
20 Correct 1 ms 344 KB Output is correct
21 Correct 7 ms 2012 KB Output is correct
22 Correct 6 ms 1760 KB Output is correct
23 Correct 29 ms 6104 KB Output is correct
24 Correct 20 ms 5324 KB Output is correct
25 Correct 21 ms 5336 KB Output is correct
26 Correct 14 ms 3292 KB Output is correct
27 Correct 16 ms 3548 KB Output is correct
28 Correct 22 ms 5140 KB Output is correct
29 Correct 16 ms 3244 KB Output is correct
30 Correct 38 ms 6352 KB Output is correct