oj.uz

답안 #445906

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
445906 2021-07-20T06:33:26 Z Jasiekstrz Sjekira (COCI20_sjekira) C++17
110 / 110
 92 ms 11648 KB 
#include<bits/stdc++.h>
#define fi first
#define se second
using namespace std;
const int N=1e5;
int tab[N+10];
vector<pair<int,int>> e[N+10];
bool vis[N+10];
priority_queue<pair<int,int>> pq;
vector<pair<int,int>> ord;
int fau[N+10];
int f(int x)
{
	return (fau[x]==x ? x:fau[x]=f(fau[x]));
}
void u(int x,int y)
{
	x=f(x);
	y=f(y);
	if(tab[x]>tab[y])
		fau[y]=x;
	else
		fau[x]=y;
	return;
}
int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cout.tie(NULL);
	int n;
	cin>>n;
	for(int i=1;i<=n;i++)
	{
		cin>>tab[i];
		pq.push({tab[i],i});
		fau[i]=i;
	}
	for(int i=1;i<n;i++)
	{
		int a,b;
		cin>>a>>b;
		e[a].emplace_back(b,i);
		e[b].emplace_back(a,i);
	}
	long long ans=0;
	while(!pq.empty())
	{
		int x=pq.top().se;
		pq.pop();
		for(auto [v,id]:e[x])
		{
			if(vis[id])
				continue;
			vis[id]=true;
			ord.emplace_back(x,v);
		}
	}
	reverse(ord.begin(),ord.end());
	for(auto [a,b]:ord)
	{
		ans+=tab[f(a)]+tab[f(b)];
		u(a,b);
	}
	cout<<ans<<"\n";
	return 0;
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2636 KB Output is correct
2 Correct 2 ms 2620 KB Output is correct
3 Correct 2 ms 2636 KB Output is correct
4 Correct 2 ms 2636 KB Output is correct
5 Correct 2 ms 2636 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 64 ms 8100 KB Output is correct
2 Correct 45 ms 6292 KB Output is correct
3 Correct 45 ms 6268 KB Output is correct
4 Correct 52 ms 7356 KB Output is correct
5 Correct 75 ms 8904 KB Output is correct
6 Correct 56 ms 8944 KB Output is correct
7 Correct 49 ms 10148 KB Output is correct
8 Correct 48 ms 9516 KB Output is correct
9 Correct 30 ms 6936 KB Output is correct
10 Correct 66 ms 11084 KB Output is correct

Subtask #3
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2636 KB Output is correct
2 Correct 2 ms 2620 KB Output is correct
3 Correct 2 ms 2636 KB Output is correct
4 Correct 2 ms 2636 KB Output is correct
5 Correct 2 ms 2636 KB Output is correct
6 Correct 2 ms 2636 KB Output is correct
7 Correct 2 ms 2636 KB Output is correct
8 Correct 2 ms 2636 KB Output is correct
9 Correct 3 ms 2636 KB Output is correct
10 Correct 2 ms 2636 KB Output is correct

Subtask #4
60.0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2636 KB Output is correct
2 Correct 2 ms 2620 KB Output is correct
3 Correct 2 ms 2636 KB Output is correct
4 Correct 2 ms 2636 KB Output is correct
5 Correct 2 ms 2636 KB Output is correct
6 Correct 64 ms 8100 KB Output is correct
7 Correct 45 ms 6292 KB Output is correct
8 Correct 45 ms 6268 KB Output is correct
9 Correct 52 ms 7356 KB Output is correct
10 Correct 75 ms 8904 KB Output is correct
11 Correct 56 ms 8944 KB Output is correct
12 Correct 49 ms 10148 KB Output is correct
13 Correct 48 ms 9516 KB Output is correct
14 Correct 30 ms 6936 KB Output is correct
15 Correct 66 ms 11084 KB Output is correct
16 Correct 2 ms 2636 KB Output is correct
17 Correct 2 ms 2636 KB Output is correct
18 Correct 2 ms 2636 KB Output is correct
19 Correct 3 ms 2636 KB Output is correct
20 Correct 2 ms 2636 KB Output is correct
21 Correct 18 ms 4708 KB Output is correct
22 Correct 15 ms 4476 KB Output is correct
23 Correct 81 ms 11324 KB Output is correct
24 Correct 54 ms 9168 KB Output is correct
25 Correct 57 ms 9148 KB Output is correct
26 Correct 36 ms 6776 KB Output is correct
27 Correct 53 ms 7364 KB Output is correct
28 Correct 58 ms 9196 KB Output is correct
29 Correct 38 ms 6800 KB Output is correct
30 Correct 92 ms 11648 KB Output is correct