Jungle Roads---poj1251 hdu1301

#include<stdio.h>
#include<string.h>
#include<map>
#include<iostream>
#include<algorithm>
#include<math.h>
#define N 110
#define INF 0xfffffff

using namespace std;

int dist
, vis
, n, maps

;

void Init()
{
for(int i=0; i<=n; i++)
{
vis[i] = 0;
dist[i] = INF;
for(int j=0; j<=n; j++)
{
maps[i][j] = INF;
}
}
}

int Prim(int start)
{
int ans = 0;
for(int i=1; i<=n; i++)
dist[i] = maps[start][i];
vis[start] = 1;
for(int i=1; i<n; i++)
{
int Min = INF,index = -1;
for(int j=1; j<=n; j++)
{
if(vis[j]==0 && Min > dist[j])
Min = dist[j], index = j;
}
if(index == -1) break;
vis[index] = 1;
ans += Min;
for(int j=1; j<=n; j++)
{
if(vis[j]==0 && dist[j] > maps[index][j])
{
dist[j] = maps[index][j];
}
}
}
return ans;
}

int main()
{
int i, j, x, a, b, ans, m;
char s[5];
while(scanf("%d", &n), n)
{
Init();
for(i=1; i<n; i++)
{
scanf("%s%d", s, &m);
a = s[0] - 'A' + 1;
for(j=0; j<m; j++)
{
scanf("%s%d", s, &x);
b = s[0] - 'A' + 1;
maps[a][b] = maps[b][a] = min(maps[a][b],x);
}
}
ans = Prim(1);
printf("%d\n", ans);
}
return 0;
}