村村通 ( 很久以前打的 )
go to the problem
#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
struct Edge{
int f,t,d;
}es[300000];
int fa[30000],k[101][101];
bool used[101][101];
int find(int x)
{
return fa[x]==x?x:fa[x]=find(fa[x]);
}
bool cmp(Edge a,Edge b)
{
return a.d<b.d;
}
int main()
{
int n,m=0,cnt=0,ans=0;
scanf("%d",&n);
for(int i=1;i<=n;++i)
for(int j=1;j<=n;++j)
{
scanf("%d",&k[i][j]);
if(!used[i][j]&&k[i][j]!=0)
{
++m;
es[m].d=k[i][j];
es[m].f=i;
es[m].t=j;
used[i][j]=true;
used[j][i]=true;
}
}
sort(es+1,es+m+1,cmp);
for(int i=1;i<=n;++i) fa[i]=i;
int x,y;
for(int i=1;i<=m;++i)
{
x=find(es[i].f);y=find(es[i].t);
if(x!=y)
{
++cnt;
ans+=es[i].d;
fa[x]=y;
}
if(cnt==n-1) break;
}
cout<<ans;
return 0;
}
繁忙的都市
go to the problem
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
using namespace std;
int N,M,cnt,maxn;
int fa[310];
struct maple{
int f,t,d;
}Rode[50010];
bool cmp(maple a,maple b)
{
return a.d<b.d;
}
int find(int x)
{
return fa[x]==x?x:fa[x]=find(fa[x]);
}
int main()
{
scanf("%d%d",&N,&M);
for(int i=1;i<=M;++i)
scanf("%d%d%d",&Rode[i].f,&Rode[i].t,&Rode[i].d);
for(int i=1;i<=N;++i) fa[i]=i;
sort(Rode+1,Rode+M+1,cmp);
for(int i=1;i<=M;++i)
{
int x=find(Rode[i].f),y=find(Rode[i].t);
if(x!=y)
{
fa[x]=y;
++cnt;
if(cnt==N-1)
{
maxn=Rode[i].d;
break;
}
}
}
cout<<cnt<<" "<<maxn;
return 0;
}