HDU-1879 继续畅通工程 prime

#include "stdio.h"
#include "string.h"
const int maxn = 105;
const int inf = 1<<30;
int n;
int map[maxn][maxn],dis[maxn];
bool vis[maxn];

int prime()
{
	int i,j,min,pos,ans = 0;        //起点 答案
	vis[1] = true;
	pos = 1;
	for( i=1;i<=n;i++ )
	{
		dis[i] = map[pos][i];
	}
	for( i=1;i<n;i++ )
	{
		min = inf;
		for( j=1;j<=n;j++ )
		{
			if( !vis[j] && min > dis[j] )
			{
				min = dis[pos=j];
			}
		}
		ans += min;
		vis[pos] = true;
		for( j=1;j<=n;j++ )
		{
			if( !vis[j] && dis[j] > map[pos][j] )
				 dis[j] = map[pos][j];
		}
	}
	return ans;
}

int main()
{
	int i,j,m,a,b,c,d;
	while( scanf("%d",&n)!=EOF,n )
	{
		m = n*(n-1)/2;
		for( i=0;i<=n;i++ )
		{
			vis[i] = 0;
			for( j=0;j<=n;j++ )
			{
				map[i][j] = inf;
			}
		}
		for( i=1;i<=m;i++ )
		{
			scanf("%d%d%d%d",&a,&b,&c,&d);
			if( d )
			{
				map[a][b] = map[b][a] = 0;
			}
			else
			{
				map[a][b] = map[b][a] = c;
			}
		}
		printf("%d\n",prime());
	}
	return 0;
}