题目链接
将公路按建成时间升序排序。维护并查集是增加一个记录子树个数的数组size。合并时让编号小的作为父亲,这样可以根据size[1]来判断是否全部通车。
#include<cstdio>
#include<algorithm>
using namespace std;
#define _rep(i,a,b) for(int i=(a);i<=(b);i++)
const int N=1e3+10,M=1e5+10;
int n,m,fa[N],size[N];
struct Edge{
int u,v,t;
bool operator <(const Edge&rhs)const{
return t<rhs.t;}
}edge[M];
int findfa(int x){return fa[x]==x?x:fa[x]=findfa(fa[x]);}
void merge(int x,int y)
{
int fx=findfa(x);
int fy=findfa(y);
if(fx>fy)swap(fx,fy);
fa[fy]=fx;
size[fx]+=size[fy];
}
int main()
{
//freopen("in.txt","r",stdin);
scanf("%d%d",&n,&m);
int ans=0;
_rep(i,1,m)scanf("%d%d%d",&edge[i].u,&edge[i].v,&edge[i].t);
sort(edge+1,edge+m+1);
_rep(i,1,n)fa[i]=i,size[i]=1;
_rep(i,1,m)
{
int u=edge[i].u;
int v=edge[i].v;
if(findfa(u)!=findfa(v))merge(u,v);
if(size[1]==n){ans=edge[i].t;break;}
}
if(!ans)puts("-1");
else printf("%d\n",ans);
return 0;
}