oj.uz

Submission #328432

# Submission time Handle Problem Language Result Execution time Memory
328432 2020-11-16T14:32:15 Z kshitij_sodani Sjekira (COCI20_sjekira) C++14
110 / 110
 78 ms 10464 KB 
//#pragma GCC optimize("Ofast,unroll-loops")
#include <bits/stdc++.h>
using namespace std;
typedef long long llo;
#define mp make_pair
#define pb push_back
#define a first 
#define b second
#define endl '\n'
llo n;
llo it[100001];
vector<pair<llo,llo>> ss; 
llo par[100001];
vector<llo> adj[100001];
llo find(llo no){
	if(par[no]==no){
		return no;
	}
	par[no]=find(par[no]);
	return par[no];
}
int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cin>>n;
	for(llo i=0;i<n;i++){
		cin>>it[i];
		ss.pb({it[i],i});
		par[i]=i;
	}
	sort(ss.begin(),ss.end());
	for(llo i=0;i<n-1;i++){
		llo aa,bb;
		cin>>aa>>bb;
		aa--;
		bb--;
		adj[aa].pb(bb);
		adj[bb].pb(aa);
	}
	llo ans=0;

	for(auto j:ss){
		for(auto i:adj[j.b]){
			if(it[i]<it[j.b] or (it[i]==it[j.b] and i<j.b)){
				llo ii=find(i);
				ans+=j.a+it[ii];
				par[ii]=j.b;
			}
		}
	}



	cout<<ans<<endl;


 
 
	return 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 53 ms 7776 KB Output is correct
2 Correct 40 ms 6628 KB Output is correct
3 Correct 36 ms 6500 KB Output is correct
4 Correct 46 ms 6880 KB Output is correct
5 Correct 66 ms 8928 KB Output is correct
6 Correct 47 ms 10464 KB Output is correct
7 Correct 41 ms 8928 KB Output is correct
8 Correct 39 ms 8672 KB Output is correct
9 Correct 24 ms 6756 KB Output is correct
10 Correct 46 ms 10132 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 2 ms 2796 KB Output is correct
8 Correct 2 ms 2796 KB Output is correct
9 Correct 2 ms 2796 KB Output is correct
10 Correct 3 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 53 ms 7776 KB Output is correct
7 Correct 40 ms 6628 KB Output is correct
8 Correct 36 ms 6500 KB Output is correct
9 Correct 46 ms 6880 KB Output is correct
10 Correct 66 ms 8928 KB Output is correct
11 Correct 47 ms 10464 KB Output is correct
12 Correct 41 ms 8928 KB Output is correct
13 Correct 39 ms 8672 KB Output is correct
14 Correct 24 ms 6756 KB Output is correct
15 Correct 46 ms 10132 KB Output is correct
16 Correct 2 ms 2796 KB Output is correct
17 Correct 2 ms 2796 KB Output is correct
18 Correct 2 ms 2796 KB Output is correct
19 Correct 2 ms 2796 KB Output is correct
20 Correct 3 ms 2796 KB Output is correct
21 Correct 21 ms 4332 KB Output is correct
22 Correct 13 ms 4076 KB Output is correct
23 Correct 78 ms 9312 KB Output is correct
24 Correct 56 ms 7392 KB Output is correct
25 Correct 48 ms 7264 KB Output is correct
26 Correct 29 ms 5736 KB Output is correct
27 Correct 36 ms 6372 KB Output is correct
28 Correct 57 ms 7648 KB Output is correct
29 Correct 35 ms 6120 KB Output is correct
30 Correct 77 ms 9568 KB Output is correct