oj.uz

답안 #469551

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
469551 2021-09-01T10:09:41 Z ahmeteren Sjekira (COCI20_sjekira) C++14
110 / 110
 75 ms 9928 KB 
#include <bits/stdc++.h>
using namespace std;

const int N = 1e5 + 5;

int size[N], mx[N], root[N];
vector<int> vec[N];

int find_set(int node)
{
	if(root[node] == node)
		return node;

	return root[node] = find_set(root[node]);
}

void union_set(int a, int b)
{
	a = find_set(a), b = find_set(b);

	if(size[a] < size[b])
		swap(a, b);

	size[a] += size[b];
	root[b] = a;
	mx[a] = max(mx[a], mx[b]);
}

int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	
	long long n, cevap = 0;
	cin >> n;

	vector<pair<int, int> > v(n + 1);

	for(int i = 1; i <= n; i++)
	{
		cin >> mx[i];

		root[i] = i;
		size[i] = 1;

		v[i] = {mx[i], i};
	}

	for(int i = 1; i < n; i++)
	{
		int u, v;
		cin >> u >> v;

		vec[u].push_back(v);
		vec[v].push_back(u);
	}

	sort(v.begin() + 1, v.end());

	for(int i = 1; i <= n; i++)
	{
		int node = v[i].second;

		for(auto to : vec[node])
		{
			if(mx[find_set(to)] <= v[i].first)
			{
				if(find_set(to) != find_set(node))
				{
					cevap += v[i].first + mx[find_set(to)];
					union_set(node, to);
				}
			}
		}
	}

	cout << cevap << '\n';

	return 0;
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 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

# 결과 실행 시간 메모리 Grader output
1 Correct 50 ms 7872 KB Output is correct
2 Correct 39 ms 7096 KB Output is correct
3 Correct 45 ms 6904 KB Output is correct
4 Correct 43 ms 7420 KB Output is correct
5 Correct 64 ms 9808 KB Output is correct
6 Correct 61 ms 9768 KB Output is correct
7 Correct 42 ms 8840 KB Output is correct
8 Correct 38 ms 8184 KB Output is correct
9 Correct 26 ms 6348 KB Output is correct
10 Correct 51 ms 9756 KB Output is correct

Subtask #3
30.0 / 30.0

# 결과 실행 시간 메모리 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 2676 KB Output is correct
7 Correct 2 ms 2636 KB Output is correct
8 Correct 2 ms 2636 KB Output is correct
9 Correct 2 ms 2636 KB Output is correct
10 Correct 2 ms 2636 KB Output is correct

Subtask #4
60.0 / 60.0

# 결과 실행 시간 메모리 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 50 ms 7872 KB Output is correct
7 Correct 39 ms 7096 KB Output is correct
8 Correct 45 ms 6904 KB Output is correct
9 Correct 43 ms 7420 KB Output is correct
10 Correct 64 ms 9808 KB Output is correct
11 Correct 61 ms 9768 KB Output is correct
12 Correct 42 ms 8840 KB Output is correct
13 Correct 38 ms 8184 KB Output is correct
14 Correct 26 ms 6348 KB Output is correct
15 Correct 51 ms 9756 KB Output is correct
16 Correct 2 ms 2676 KB Output is correct
17 Correct 2 ms 2636 KB Output is correct
18 Correct 2 ms 2636 KB Output is correct
19 Correct 2 ms 2636 KB Output is correct
20 Correct 2 ms 2636 KB Output is correct
21 Correct 16 ms 4340 KB Output is correct
22 Correct 13 ms 4088 KB Output is correct
23 Correct 72 ms 9540 KB Output is correct
24 Correct 55 ms 7660 KB Output is correct
25 Correct 45 ms 7512 KB Output is correct
26 Correct 31 ms 5808 KB Output is correct
27 Correct 34 ms 6476 KB Output is correct
28 Correct 55 ms 7492 KB Output is correct
29 Correct 33 ms 5964 KB Output is correct
30 Correct 75 ms 9928 KB Output is correct