hdu 继续畅通中。

不用多说，用模板。

 

#include<stdio.h>
#include<string.h>
const int maxn = 110;
const int INF = 0xfffffff;
int map[maxn][maxn],lowcost[maxn],vis[maxn],n;

int prim()
{
    int i,j,k,mins,yes,sum=0;
    for(i=1;i<=n;i++) lowcost[i] = map[1][i];
    memset(vis,0,sizeof(vis));
    vis[1]=1;
    for(;;)
    {
        mins=INF;
        yes=-1;
        for(j=1;j<=n;j++)
        {
            if(!vis[j] && lowcost[j] < mins)
            {
                mins=lowcost[j];
                yes=1;
                k=j;
            }
        }
        if(yes==-1) break;
        sum+=mins;
        vis[k]=1;
        for(j=1;j<=n;j++)
            if(!vis[j] && lowcost[j] > map[k][j]) 
                lowcost[j] = map[k][j];
    }
    return sum;
}

int main()
{
    int i,j;
    int x,y,costs,flag;
    while(scanf("%d",&n)!=EOF,n)
    {
        for(i=1;i<=n;i++)
        {
            for(j=1;j<=n;j++) map[i][j] = map[j][i] = INF;
            map[i][i] = 0;
        }

        for(i=1;i<=n*(n-1)/2;i++)
        {
            scanf("%d%d%d%d",&x,&y,&costs,&flag);
            if(flag) costs = 0;
            if(costs<map[x][y]) map[x][y] = costs;
            if(costs<map[y][x]) map[y][x] = costs;
        }
        printf("%d\n",prim());
    }
    return 0;
}