HDU 1863 畅通工程 (Kruskal)

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<queue>
#include<stack>
#include<set>
#include<map>
#include <iomanip>
#define x first
#define y second
#define met(a,b) memset(a,b,sizeof a)
#define open 	ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;
map<string,int>mapp;
typedef long long ll;
const int N=115;
int f[N];
struct node {
	int f,t,s;
} a[N];
int findd(int x) {
	if(f[x]!=x)
		f[x]=findd(f[x]);
	return f[x];
}
bool cmp(node a,node b) {
	return a.s<b.s;
}
int n,m;
int main() {
	//open;
	while(cin>>n>>m) {
		if(!n)break;
		for(int i=1; i<=m; i++)f[i]=i;
		for(int i=1; i<=n; i++) {
			cin>>a[i].f>>a[i].t>>a[i].s;
		}
		sort(a+1,a+1+n,cmp);
		int res=0,c=1;
		for(int i=1; i<=n; i++) {
			int x,y;
			x=a[i].f;
			y=a[i].t;
			if(findd(x)==findd(y))continue;
			res+=a[i].s;
			f[findd(x)]=findd(y);
			c++;
		}
		if(c!=m)cout<<"?\n";
		else cout<<res<<endl;

	}
}

题解：先走一边Kruskal，走完判断是否将所有的都以连接

畅通工程再续