oj.uz

Submission #364762

# Submission time Handle Problem Language Result Execution time Memory
364762 2021-02-10T00:16:46 Z MohamedAhmed04 Sjekira (COCI20_sjekira) C++14
110 / 110
 93 ms 10856 KB 
#include <bits/stdc++.h>

using namespace std ;

const int MAX = 1e5 + 10 ;

int arr[MAX] ;
int n ;

vector< vector<int> >adj(MAX) ;
vector< pair<int , int> >vp ;

int par[MAX] , sz[MAX] , val[MAX] ;
int mark[MAX] ;

void init()
{
	for(int i = 1 ; i <= n ; ++i)
		par[i] = i , sz[i] = 1 , val[i] = arr[i] ;
}

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

void Union(int x , int y)
{
	int a = root(x) ;
	int b = root(y) ;
	if(sz[a] < sz[b])
		swap(a , b) ;
	par[b] = a ;
	sz[a] += sz[b] ;
	val[a] = max(val[a] , val[b]) ;
}

int main()
{
	ios_base::sync_with_stdio(0) ;
	cin.tie(0) ;
	cin>>n ;
	for(int i = 1 ; i <= n ; ++i)
	{
		cin>>arr[i] ;
		vp.emplace_back(arr[i] , i) ;
	}
	for(int i = 0 ; i < n-1 ; ++i)
	{
		int x , y ;
		cin>>x>>y ;
		adj[x].push_back(y) ;
		adj[y].push_back(x) ;
	}
	init() ;
	sort(vp.begin() , vp.end()) ;
	long long ans = 0 ;
	for(auto &p : vp)
	{
		int node = p.second ;
		mark[node] = 1 ;
		for(auto &child : adj[node])
		{
			if(mark[child])
				ans += arr[node] + val[root(child)] ;
		}
		for(auto &child : adj[node])
		{
			if(mark[child])
				Union(node , child) ;
		}
	}
	return cout<<ans<<"\n" , 0 ;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 52 ms 7528 KB Output is correct
2 Correct 38 ms 6380 KB Output is correct
3 Correct 37 ms 6272 KB Output is correct
4 Correct 41 ms 6632 KB Output is correct
5 Correct 66 ms 8680 KB Output is correct
6 Correct 46 ms 8552 KB Output is correct
7 Correct 41 ms 9576 KB Output is correct
8 Correct 38 ms 9192 KB Output is correct
9 Correct 25 ms 6764 KB Output is correct
10 Correct 51 ms 10728 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2668 KB Output is correct
2 Correct 2 ms 2668 KB Output is correct
3 Correct 2 ms 2668 KB Output is correct
4 Correct 2 ms 2668 KB Output is correct
5 Correct 2 ms 2668 KB Output is correct
6 Correct 2 ms 2796 KB Output is correct
7 Correct 3 ms 2796 KB Output is correct
8 Correct 3 ms 2796 KB Output is correct
9 Correct 2 ms 2796 KB Output is correct
10 Correct 2 ms 2796 KB Output is correct

Subtask #4
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2668 KB Output is correct
2 Correct 2 ms 2668 KB Output is correct
3 Correct 2 ms 2668 KB Output is correct
4 Correct 2 ms 2668 KB Output is correct
5 Correct 2 ms 2668 KB Output is correct
6 Correct 52 ms 7528 KB Output is correct
7 Correct 38 ms 6380 KB Output is correct
8 Correct 37 ms 6272 KB Output is correct
9 Correct 41 ms 6632 KB Output is correct
10 Correct 66 ms 8680 KB Output is correct
11 Correct 46 ms 8552 KB Output is correct
12 Correct 41 ms 9576 KB Output is correct
13 Correct 38 ms 9192 KB Output is correct
14 Correct 25 ms 6764 KB Output is correct
15 Correct 51 ms 10728 KB Output is correct
16 Correct 2 ms 2796 KB Output is correct
17 Correct 3 ms 2796 KB Output is correct
18 Correct 3 ms 2796 KB Output is correct
19 Correct 2 ms 2796 KB Output is correct
20 Correct 2 ms 2796 KB Output is correct
21 Correct 16 ms 4592 KB Output is correct
22 Correct 15 ms 4336 KB Output is correct
23 Correct 75 ms 10344 KB Output is correct
24 Correct 49 ms 8168 KB Output is correct
25 Correct 49 ms 8168 KB Output is correct
26 Correct 36 ms 6252 KB Output is correct
27 Correct 36 ms 7020 KB Output is correct
28 Correct 58 ms 8296 KB Output is correct
29 Correct 36 ms 6380 KB Output is correct
30 Correct 93 ms 10856 KB Output is correct