oj.uz

Submission #807346

# Submission time Handle Problem Language Result Execution time Memory
807346 2023-08-04T16:11:02 Z Tunglam07 Sjekira (COCI20_sjekira) C++17
110 / 110
 84 ms 4704 KB 
#include<bits/stdc++.h>
using namespace std;
 
long long n, a[100001], parent[100001], ans[100001], sum = 0;
pair<int, pair<int, int>> connect[100001];
 
int findparent(int id)
{
	if(id == parent[id])	
	{
		return id;
	}
	else	
	{
		return parent[id] = findparent(parent[id]);
	}
}
 
int main()
{
	cin >> n;
	for(int i = 1; i <= n; ++i)
	{
		cin >> a[i];
		parent[i] = i;
		ans[i] = a[i];
	}
	for(int i = 1; i < n; ++i)
	{
		cin >> connect[i].second.first >> connect[i].second.second;
		connect[i].first = max(a[connect[i].second.first], a[connect[i].second.second]);
	}
	sort(connect + 1, connect + n);
	for(int i = 1; i < n; ++i)
	{
		long long x = findparent(connect[i].second.first), y = findparent(connect[i].second.second);
		sum = sum + ans[x] + ans[y];
		if(x != y)
		{
			parent[x] = y;
			ans[y] = max(ans[x], ans[y]);
		}
	}
	cout << sum;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 76 ms 3300 KB Output is correct
2 Correct 46 ms 2620 KB Output is correct
3 Correct 45 ms 2592 KB Output is correct
4 Correct 51 ms 2892 KB Output is correct
5 Correct 76 ms 3964 KB Output is correct
6 Correct 76 ms 4704 KB Output is correct
7 Correct 65 ms 3848 KB Output is correct
8 Correct 59 ms 3804 KB Output is correct
9 Correct 39 ms 2676 KB Output is correct
10 Correct 74 ms 4504 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 308 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 308 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 320 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 316 KB Output is correct

Subtask #4
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 308 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 308 KB Output is correct
6 Correct 76 ms 3300 KB Output is correct
7 Correct 46 ms 2620 KB Output is correct
8 Correct 45 ms 2592 KB Output is correct
9 Correct 51 ms 2892 KB Output is correct
10 Correct 76 ms 3964 KB Output is correct
11 Correct 76 ms 4704 KB Output is correct
12 Correct 65 ms 3848 KB Output is correct
13 Correct 59 ms 3804 KB Output is correct
14 Correct 39 ms 2676 KB Output is correct
15 Correct 74 ms 4504 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 320 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 316 KB Output is correct
21 Correct 18 ms 1356 KB Output is correct
22 Correct 17 ms 1268 KB Output is correct
23 Correct 72 ms 3888 KB Output is correct
24 Correct 55 ms 2956 KB Output is correct
25 Correct 51 ms 2812 KB Output is correct
26 Correct 42 ms 2136 KB Output is correct
27 Correct 41 ms 2380 KB Output is correct
28 Correct 57 ms 3148 KB Output is correct
29 Correct 34 ms 2272 KB Output is correct
30 Correct 84 ms 4056 KB Output is correct