Submission #334650

# Submission time Handle Problem Language Result Execution time Memory
334650 2020-12-09T15:48:00 Z GioChkhaidze Sjekira (COCI20_sjekira) C++14
110 / 110
115 ms 2932 KB
#include <bits/stdc++.h>

#define ll long long
#define pb push_back
#define F first
#define S second

using namespace std;

const int N=1e5+5;

ll ans;
int n,a[N],p[N],x,y;

vector < pair < int , pair < int , int > > > s;
 
int P(int x) {
	if (x==p[x]) return x;
	return p[x]=P(p[x]);
} 
 
main () {
	cin>>n;
	for (int i=1; i<=n; i++) {
		cin>>a[i];
		p[i]=i;
	}
	
	for (int i=1; i<n; i++) {
		cin>>x>>y;
		s.pb({max(a[x],a[y]),{x,y}});
	}
	
	sort(s.begin(),s.end());
	for (int i=0; i<s.size(); i++) {
		x=s[i].S.F,y=s[i].S.S;
		x=P(x),y=P(y); 
		ans+=a[x]+a[y];
		p[y]=x;
		a[x]=max(a[x],a[y]);
	}
	
	cout<<ans<<"\n";
}

Compilation message

sjekira.cpp:22:7: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   22 | main () {
      |       ^
sjekira.cpp: In function 'int main()':
sjekira.cpp:35:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, std::pair<int, int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   35 |  for (int i=0; i<s.size(); i++) {
      |                ~^~~~~~~~~
# Verdict Execution time Memory Grader output
1 Correct 0 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 0 ms 364 KB Output is correct
5 Correct 0 ms 364 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 90 ms 2660 KB Output is correct
2 Correct 68 ms 1772 KB Output is correct
3 Correct 67 ms 1764 KB Output is correct
4 Correct 74 ms 2532 KB Output is correct
5 Correct 111 ms 2788 KB Output is correct
6 Correct 115 ms 2788 KB Output is correct
7 Correct 94 ms 2660 KB Output is correct
8 Correct 87 ms 2788 KB Output is correct
9 Correct 56 ms 1640 KB Output is correct
10 Correct 107 ms 2932 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 0 ms 364 KB Output is correct
5 Correct 0 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 2 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 0 ms 364 KB Output is correct
5 Correct 0 ms 364 KB Output is correct
6 Correct 90 ms 2660 KB Output is correct
7 Correct 68 ms 1772 KB Output is correct
8 Correct 67 ms 1764 KB Output is correct
9 Correct 74 ms 2532 KB Output is correct
10 Correct 111 ms 2788 KB Output is correct
11 Correct 115 ms 2788 KB Output is correct
12 Correct 94 ms 2660 KB Output is correct
13 Correct 87 ms 2788 KB Output is correct
14 Correct 56 ms 1640 KB Output is correct
15 Correct 107 ms 2932 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 2 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 25 ms 1068 KB Output is correct
22 Correct 21 ms 940 KB Output is correct
23 Correct 105 ms 2788 KB Output is correct
24 Correct 85 ms 2532 KB Output is correct
25 Correct 75 ms 2532 KB Output is correct
26 Correct 49 ms 1512 KB Output is correct
27 Correct 58 ms 1640 KB Output is correct
28 Correct 73 ms 2532 KB Output is correct
29 Correct 48 ms 1640 KB Output is correct
30 Correct 112 ms 2916 KB Output is correct