APC001 D - Forest 贪心？

题目链接

这题我硬是头铁要用可并堆做… 结果调了一晚上

用并查集加可并堆维护集合 因为每次都是要从一个集合向另一个集合连边并且合并

直接做就好了 连边的时候注意从大的集合向小的集合连边即可

这样子保证大集合永远不为空

Codes

#include<bits/stdc++.h>
#include<ext/pb_ds/priority_queue.hpp>
 
#define int long long
 
using namespace std;
 
const int N = 1e5 + 10;
 
__gnu_pbds::priority_queue<int, greater<int>, __gnu_pbds::pairing_heap_tag> val[N];
int n, m, fa[N], ans, cnt, tot, vis[N];
pair<int, int> tmp[N];
 
int find(int x) {
	return fa[x] = x == fa[x] ? x : find(fa[x]);
}	
 
signed main() {
	//freopen("apc001d.in", "r", stdin);
	//freopen("apc001d.out", "w", stdout);
	int x, y, now;
	scanf("%lld%lld", &n, &m);
	for(int i = 1; i <= n; ++ i) 
		scanf("%lld", &x), val[fa[i] = i].push(x);
	for(int i = 1; i <= m; ++ i) {
		scanf("%lld%lld", &x, &y);
		++ x, ++ y;
		x = find(x), y = find(y);
		if(x != y) ++ cnt, fa[y] = x, val[x].join(val[y]);
	}
	if(cnt + n / 2 < n - 1) return puts("Impossible"), 0;
	for(int i = 1; i <= n; vis[find(i)] = 1, ++ i)
		if(!vis[find(i)]) 
			tmp[++ tot] = make_pair(val[find(i)].size(), find(i));
	sort(tmp + 1, tmp + tot + 1);
	now = find(tmp[tot].second);
	for(int i = tot - 1; i; -- i) {
		int u = now, v = tmp[i].second;
		if(u == v || val[v].empty()) continue;
		ans += val[u].top() + val[v].top();
		val[u].pop(), val[v].pop();
		val[u].join(val[v]), fa[v] = u;
		++ cnt;
	}
	printf("%lld\n", ans);
	return 0;
}