[最小生成树] 畅通工程

题目

代码

#include<cstdio>
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<cctype>
#include<ctime>
#include<iostream>
#include<string>
#include<map>
#include<queue>
#include<stack>
#include<set>
#include<vector>
#include<iomanip>
#include<list>
#include<bitset>
#include<sstream>
#include<fstream>
#include<complex>
#include<algorithm>
#if __cplusplus >= 201103L
#include <unordered_map>
#include <unordered_set>
#endif
#define ll long long
#define int long long 
using namespace std;
const int INF = 0x3f3f3f3f;
int n,m;
int f[110];
int find(int x){
	while(f[x]!=x){
		x=f[x];
	}
	return x;
}
bool uni(int u,int v){
	if(find(u)!=find(v)){
		f[find(u)]=find(v);
		return 1;
	}
	return 0;
}
struct sut{
	int u,v,w;
}a[110];
int cmp(sut a,sut b){
	return a.w<b.w;
}
signed main(){
	while(cin>>n>>m){
		if(n==0) break;
	for(int i=1;i<=m;i++) f[i]=i;
	for(int i=1;i<=n;i++){
		cin>>a[i].u>>a[i].v>>a[i].w;
	}
	sort(a+1,a+1+n,cmp);
	int res=0,ans=0;
	for(int i=1;i<=n;i++){
		if(uni(a[i].u,a[i].v)){
			res++;
			ans+=a[i].w;
		}
	}
	if(res==m-1) cout<<ans<<endl;
	else cout<<"?"<<endl;}
    return 0;
}