7-14 公路村村通 (30分)

题目链接
解题思路：并查集变形
AC代码：

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<string>
#include<map>
#include<stack>
#include<queue>
using namespace std;
int n,m,ans=0;
int fa[1005];
struct road{
	int start,end,w;
};
vector<road> e;
vector<road> mp;
inline void init(int n)
{
    for(int i=1;i<=n;i++)
		fa[i] = i;
}
int find(int x)
{
	return (fa[x]==x)?x:(fa[x]=find(fa[x]));
}
void merge()
{
	int len = e.size();
	for(int i=0;i<len && mp.size()<n-1;i++)
    {
		int a,b;
		a = e[i].start;
		b = e[i].end;
		if(find(a) != find(b)){
			mp.push_back(e[i]);
			ans += e[i].w;
			fa[find(a)] = find(b);
		}
	}
}
bool cmp(road x,road y)
{
	return x.w<y.w;
}
int main(){
	cin>>n>>m;
	init(n);
	for(int i=1;i<=m;i++){
		int a,b,c;
		cin>>a>>b>>c;
		road r;
		r.start= a;
		r.end = b;
		r.w = c;
		e.push_back(r);
	}
	sort(e.begin(),e.end(),cmp);
	merge();
	if(mp.size() == n-1)
		cout<<ans<<endl;
	else
		cout<<-1<<endl;
}