| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 807171 |
2023-08-04T14:24:36 Z |
tlnk07 |
Sjekira (COCI20_sjekira) |
C++17 |
|
86 ms |
6476 KB |
#include<bits/stdc++.h>
using namespace std;
long long n, a[100001], p[100001], sz[100001], sum = 0;
pair<int, pair<int, int>> edge[100001];
int findparent(int x)
{
if(x == p[x]) return x;
else return p[x] = findparent(p[x]);
}
int main()
{
cin >> n;
for(int i = 1; i <= n; ++i)
{
cin >> a[i];
p[i] = i;
sz[i] = a[i];
}
for(int i = 1; i < n; ++i)
{
cin >> edge[i].second.first >> edge[i].second.second;
edge[i].first = max(a[edge[i].second.first], a[edge[i].second.second]);
}
sort(edge + 1, edge + n);
for(int i = 1; i < n; ++i)
{
long long a = findparent(edge[i].second.first), b = findparent(edge[i].second.second);
sum = sum + sz[a] + sz[b];
if(a != b)
{
p[a] = b;
sz[b] = max(sz[a], sz[b]);
}
}
cout << sum;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
212 KB |
Output is correct |
| 2 |
Correct |
0 ms |
212 KB |
Output is correct |
| 3 |
Correct |
0 ms |
340 KB |
Output is correct |
| 4 |
Correct |
1 ms |
308 KB |
Output is correct |
| 5 |
Correct |
1 ms |
212 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
61 ms |
4840 KB |
Output is correct |
| 2 |
Correct |
46 ms |
3700 KB |
Output is correct |
| 3 |
Correct |
49 ms |
3552 KB |
Output is correct |
| 4 |
Correct |
62 ms |
4060 KB |
Output is correct |
| 5 |
Correct |
75 ms |
5860 KB |
Output is correct |
| 6 |
Correct |
74 ms |
6476 KB |
Output is correct |
| 7 |
Correct |
64 ms |
5496 KB |
Output is correct |
| 8 |
Correct |
58 ms |
5140 KB |
Output is correct |
| 9 |
Correct |
38 ms |
3448 KB |
Output is correct |
| 10 |
Correct |
73 ms |
6324 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
212 KB |
Output is correct |
| 2 |
Correct |
0 ms |
212 KB |
Output is correct |
| 3 |
Correct |
0 ms |
340 KB |
Output is correct |
| 4 |
Correct |
1 ms |
308 KB |
Output is correct |
| 5 |
Correct |
1 ms |
212 KB |
Output is correct |
| 6 |
Correct |
1 ms |
480 KB |
Output is correct |
| 7 |
Correct |
1 ms |
340 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 |
340 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
212 KB |
Output is correct |
| 2 |
Correct |
0 ms |
212 KB |
Output is correct |
| 3 |
Correct |
0 ms |
340 KB |
Output is correct |
| 4 |
Correct |
1 ms |
308 KB |
Output is correct |
| 5 |
Correct |
1 ms |
212 KB |
Output is correct |
| 6 |
Correct |
61 ms |
4840 KB |
Output is correct |
| 7 |
Correct |
46 ms |
3700 KB |
Output is correct |
| 8 |
Correct |
49 ms |
3552 KB |
Output is correct |
| 9 |
Correct |
62 ms |
4060 KB |
Output is correct |
| 10 |
Correct |
75 ms |
5860 KB |
Output is correct |
| 11 |
Correct |
74 ms |
6476 KB |
Output is correct |
| 12 |
Correct |
64 ms |
5496 KB |
Output is correct |
| 13 |
Correct |
58 ms |
5140 KB |
Output is correct |
| 14 |
Correct |
38 ms |
3448 KB |
Output is correct |
| 15 |
Correct |
73 ms |
6324 KB |
Output is correct |
| 16 |
Correct |
1 ms |
480 KB |
Output is correct |
| 17 |
Correct |
1 ms |
340 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 |
340 KB |
Output is correct |
| 21 |
Correct |
22 ms |
1544 KB |
Output is correct |
| 22 |
Correct |
15 ms |
1344 KB |
Output is correct |
| 23 |
Correct |
73 ms |
5636 KB |
Output is correct |
| 24 |
Correct |
52 ms |
4064 KB |
Output is correct |
| 25 |
Correct |
51 ms |
3964 KB |
Output is correct |
| 26 |
Correct |
33 ms |
2788 KB |
Output is correct |
| 27 |
Correct |
40 ms |
3156 KB |
Output is correct |
| 28 |
Correct |
48 ms |
3916 KB |
Output is correct |
| 29 |
Correct |
32 ms |
2752 KB |
Output is correct |
| 30 |
Correct |
86 ms |
5804 KB |
Output is correct |
