abc325_E（最小生成树，建虚点）

E - Clique Connect (atcoder.jp)

第一种方法建虚点，1,2,3,4,5,...n点相互连接，相当于全部连接一个点m,这样计算最小生成树权值时会多算一条边，所以把所有边权值减去；

#include<bits/stdc++.h>
using namespace std;
using ll=long long;
typedef pair<int,int>PII;
typedef priority_queue<int> upq;
typedef priority_queue<int,vector<int>,greater<int>> dpq;
const int M=998244353;
const int N=1e6+20;

struct edge{
	int u,v,val;
};
//=========================================================
bool FileIfstream(std::string name){
    std::ifstream f(name.c_str());
    return f.good();
}
//=========================================================
bool cmp(edge a,edge b)
{
    return a.val<b.val;
}
//=========================================================
int p[N];
int find(int a){
    if(p[a] != a) p[a] = find(p[a]);
    return p[a];
}
//=========================================================

vector<edge>e;
void solved()
{
	int n,m; cin>>n>>m;
	for(int i=1;i<=n+m;i++) p[i]=i;
	ll ans=0;
	for(int i=1;i<=m;i++)
	{
		int k,v;
		cin>>k>>v;
		for(int j=1;j<=k;j++){
			int x; cin>>x;
			e.push_back({i+n,x,v}); //建虚点
		}
		ans-=v;//算权值和时会多加一次，减去
	}
	sort(e.begin(),e.end(),cmp);
	int cnt=0;
	for(auto ed:e)
	{
		int pa=find(ed.u),pb=find(ed.v);
		if(pa!=pb) 
		{
			p[pa]=pb;
			ans+=ed.val;
			cnt++;
		}
	}
	if(cnt!=n+m-1) cout<<-1<<'\n';
	else cout<<ans<<'\n';
}
int main()
{
#ifndef ONLINE_JUDGE
    if(!FileIfstream("IO.in")){
        freopen("IO.in","w",stdout);
        return 0;
    }
    freopen("IO.in","r",stdin);
    freopen("IO.out","w",stdout);
#endif
    ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
    int t=1; //cin>>t;
    while(t--)
    solved();
}

第二种方法，将输入的每一个连通块看成一个团，连通块的边权按从小到大排序，如果两个点不在一个并集里面就合并，权值加上团的边权，n--，如果n!=1的话说明不能构成最小生成树；

#include<bits/stdc++.h>
using namespace std;
using ll=long long;
typedef pair<int,int>PII;
typedef priority_queue<int> upq;
typedef priority_queue<int,vector<int>,greater<int>> dpq;
const int M=998244353;
const int N=1e6+20;


//=========================================================
bool FileIfstream(std::string name){
    std::ifstream f(name.c_str());
    return f.good();
}
//=========================================================

//=========================================================
int p[N];
int find(int a){
    if(p[a] != a) p[a] = find(p[a]);
    return p[a];
}
//=========================================================

vector<PII>v[N];
void solved()
{
	int n,m; cin>>n>>m;
	for(int i=1;i<=n;i++) p[i]=i;
	for(int i=1;i<=m;i++)
	{
		int k,c; cin>>k>>c;
		for(int j=1;j<=k;j++)
		{
			int a; cin>>a;
			v[i].push_back({c,a});
		}
	}
	sort(v+1,v+1+m); ll ans=0;

	for(int i=1;i<=m;i++)
	{
		for(int j=0;j<v[i].size()-1;j++)
		{
			if(find(p[v[i][j].second])!=find(p[v[i][j+1].second])) 
			{
				p[find(v[i][j+1].second)]=find(p[v[i][j].second]);
				ans+=v[i][j].first;
				n--;
			}
		}
	}
	if(n!=1) cout<<-1;
	else cout<<ans;
}
int main()
{
#ifndef ONLINE_JUDGE
    if(!FileIfstream("IO.in")){
        freopen("IO.in","w",stdout);
        return 0;
    }
    freopen("IO.in","r",stdin);
    freopen("IO.out","w",stdout);
#endif
    ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
    int t=1; //cin>>t;
    while(t--)
    solved();
}