继续畅通工程
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 5146 Accepted Submission(s): 2106
当N为0时输入结束。
3 1 2 1 0 1 3 2 0 2 3 4 0 3 1 2 1 0 1 3 2 0 2 3 4 1 3 1 2 1 0 1 3 2 1 2 3 4 1 0
3 1 0
#include<stdio.h>
#include<stdlib.h>
int f[109];
#define M 109
struct node{
int a,b,dist,flag;
}road[M*(M-1)/2+1];
int find(int x)
{
if(x==f[x])
return x;
return find(f[x]);
}
int cmp(const void *a,const void *b)
{
struct node *c,*d;
c=(struct node *)a;
d=(struct node *)b;
if(c->flag!=d->flag)//按flag从大到小
return d->flag-c->flag;
else按dist从小到大
return c->dist-d->dist;
}
int main()
{
int n,i;
while(scanf("%d",&n),n!=0)
{
for(i=0;i<n*(n-1)/2;i++)
scanf("%d%d%d%d",&road[i].a,&road[i].b,&road[i].dist,&road[i].flag);
for(i=1;i<=n;i++)
f[i]=i;
qsort(road,n*(n-1)/2,sizeof(road[0]),cmp);
int sum=0;
for(i=0;i<n*(n-1)/2;i++)
{
if(find(road[i].a)!=find(road[i].b))
{
f[find(road[i].a)]=find(road[i].b);
if(road[i].flag==0)
sum+=road[i].dist;
}
}
printf("%d\n",sum);
}
return 0;
}