题目:https://www.luogu.org/problemnew/show/P1546
分析:Kruskal算法求MST,快排,并查集
数据结构:前向星
AC代码:
#include<cstdio>
#include<iostream>
#include<cstring>
#include<algorithm>
using namespace std;
struct edge{
int from,to,value,next;
};
edge a[9901];
int n,v;
int num,head[101],father[101],vis[9901];
int edge_num,ans;
void join(int from,int to,int value){
a[++num].from=from;
a[num].to=to;
a[num].value=value;
a[num].next=head[from];
head[from]=num;
/*上面两行代码不用写*/
}
int find(int x){
if(father[x]==x) return x;
return father[x]=find(father[x]);
}
void unionn(int x,int y){
int r1=find(x),r2=find(y);
father[r1]=r2;
}
void qsort(int l,int r){
edge mid=a[(l+r)/2];
int i=l,j=r;
while(i<=j){
while( a[i].value<mid.value )i++;
while( a[j].value>mid.value )j--;
if(i<=j){
edge tmp=a[i];
a[i]=a[j];
a[j]=tmp;
i++;j--;
}
}
if(l<j)qsort(l,j);
if(i<r)qsort(i,r);
}
void Kruskal(){
for(int i=1;i<=num;i++){
if(!vis[i]){
vis[i]=1;
if( find(a[i].from)!=find(a[i].to) ){
unionn(a[i].from,a[i].to);
ans+=a[i].value;
edge_num++;
if(edge_num==n-1)break;
}
}
}
}
int main(){
memset(head,-1,sizeof(head));
cin>>n;
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++){
cin>>v;
if(v){
join(i,j,v);
}
}
qsort(1,num);
for(int i=1;i<=n;i++)father[i]=i;
Kruskal();
cout<<ans<<endl;
return 0;
}