oj.uz

Submission #872127

# Submission time Handle Problem Language Result Execution time Memory
872127 2023-11-12T10:50:24 Z NotLinux Sjekira (COCI20_sjekira) C++17
110 / 110
 140 ms 23752 KB 
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 7;
int n,val[N],par[N],sz[N],mx[N];
vector < int > tree[N];
vector < pair < int , int > > order;
map < pair < int , int > , bool > vis;
int find(int a){
	if(par[a] == a)return a;
	return par[a] = find(par[a]);
}
void merge(int a , int b){
	a = find(a) , b = find(b);
	if(a == b)return;
	if(sz[a] > sz[b])swap(a,b);
	sz[b] += sz[a];
	mx[b] = max(mx[b] , mx[a]);
	par[a] = b;
}
void solve(){
	iota(par , par + N , 0);
	fill(sz , sz + N , 1);
	cin >> n;
	vector < pair < int , int > > sorted_val(n+1);
	for(int i = 1;i<=n;i++){
		cin >> val[i];
		mx[i] = val[i];
		sorted_val[i] = {val[i],i};
	}
	sort(sorted_val.begin() , sorted_val.end());
	reverse(sorted_val.begin() , sorted_val.end());
	for(int i = 1;i<n;i++){
		int u,v;cin >> u >> v;
		tree[u].push_back(v);
		tree[v].push_back(u);
	}
	for(auto itr : sorted_val){
		for(auto itr1 : tree[itr.second]){
			if(vis[{itr.second,itr1}] == 0){
				vis[{itr.second,itr1}] = vis[{itr1,itr.second}] = 1;
				order.push_back({itr1,itr.second});
			}
		}
	}
	reverse(order.begin() , order.end());
	long long ans = 0;
	for(auto itr : order){
		ans += mx[find(itr.first)] + mx[find(itr.second)];
		merge(itr.first , itr.second);
	}
	cout << ans << endl;
}
signed main(){
	ios_base::sync_with_stdio(0);cin.tie(0);
	int testcase = 1;//cin >> testcase;
	while(testcase--)solve();
}

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 92 ms 19856 KB Output is correct
2 Correct 71 ms 16180 KB Output is correct
3 Correct 63 ms 15448 KB Output is correct
4 Correct 71 ms 17356 KB Output is correct
5 Correct 118 ms 23704 KB Output is correct
6 Correct 77 ms 23628 KB Output is correct
7 Correct 66 ms 20932 KB Output is correct
8 Correct 60 ms 19144 KB Output is correct
9 Correct 39 ms 13772 KB Output is correct
10 Correct 79 ms 23612 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 3420 KB Output is correct
2 Correct 1 ms 3416 KB Output is correct
3 Correct 1 ms 3420 KB Output is correct
4 Correct 1 ms 3420 KB Output is correct
5 Correct 1 ms 3596 KB Output is correct
6 Correct 2 ms 3676 KB Output is correct
7 Correct 2 ms 3676 KB Output is correct
8 Correct 2 ms 3620 KB Output is correct
9 Correct 2 ms 3676 KB Output is correct
10 Correct 2 ms 3660 KB Output is correct

Subtask #4
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 3420 KB Output is correct
2 Correct 1 ms 3416 KB Output is correct
3 Correct 1 ms 3420 KB Output is correct
4 Correct 1 ms 3420 KB Output is correct
5 Correct 1 ms 3596 KB Output is correct
6 Correct 92 ms 19856 KB Output is correct
7 Correct 71 ms 16180 KB Output is correct
8 Correct 63 ms 15448 KB Output is correct
9 Correct 71 ms 17356 KB Output is correct
10 Correct 118 ms 23704 KB Output is correct
11 Correct 77 ms 23628 KB Output is correct
12 Correct 66 ms 20932 KB Output is correct
13 Correct 60 ms 19144 KB Output is correct
14 Correct 39 ms 13772 KB Output is correct
15 Correct 79 ms 23612 KB Output is correct
16 Correct 2 ms 3676 KB Output is correct
17 Correct 2 ms 3676 KB Output is correct
18 Correct 2 ms 3620 KB Output is correct
19 Correct 2 ms 3676 KB Output is correct
20 Correct 2 ms 3660 KB Output is correct
21 Correct 26 ms 8076 KB Output is correct
22 Correct 21 ms 7680 KB Output is correct
23 Correct 135 ms 22708 KB Output is correct
24 Correct 95 ms 17608 KB Output is correct
25 Correct 84 ms 17356 KB Output is correct
26 Correct 54 ms 12492 KB Output is correct
27 Correct 63 ms 14032 KB Output is correct
28 Correct 102 ms 17864 KB Output is correct
29 Correct 66 ms 13212 KB Output is correct
30 Correct 140 ms 23752 KB Output is correct