Jungle Roads POJ - 1251 （最小生成树）&& Networking POJ - 1287

Language:Default

Jungle Roads

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 31303		Accepted: 14670

Description

The Head Elder of the tropical island of Lagrishan has a problem. A burst of foreign aid money was spent on extra roads between villages some years ago. But the jungle overtakes roads relentlessly, so the large road network is too expensive to maintain. The Council of Elders must choose to stop maintaining some roads. The map above on the left shows all the roads in use now and the cost in aacms per month to maintain them. Of course there needs to be some way to get between all the villages on maintained roads, even if the route is not as short as before. The Chief Elder would like to tell the Council of Elders what would be the smallest amount they could spend in aacms per month to maintain roads that would connect all the villages. The villages are labeled A through I in the maps above. The map on the right shows the roads that could be maintained most cheaply, for 216 aacms per month. Your task is to write a program that will solve such problems.

Input

The input consists of one to 100 data sets, followed by a final line containing only 0. Each data set starts with a line containing only a number n, which is the number of villages, 1 < n < 27, and the villages are labeled with the first n letters of the alphabet, capitalized. Each data set is completed with n-1 lines that start with village labels in alphabetical order. There is no line for the last village. Each line for a village starts with the village label followed by a number, k, of roads from this village to villages with labels later in the alphabet. If k is greater than 0, the line continues with data for each of the k roads. The data for each road is the village label for the other end of the road followed by the monthly maintenance cost in aacms for the road. Maintenance costs will be positive integers less than 100. All data fields in the row are separated by single blanks. The road network will always allow travel between all the villages. The network will never have more than 75 roads. No village will have more than 15 roads going to other villages (before or after in the alphabet). In the sample input below, the first data set goes with the map above.

Output

The output is one integer per line for each data set: the minimum cost in aacms per month to maintain a road system that connect all the villages. Caution: A brute force solution that examines every possible set of roads will not finish within the one minute time limit.

Sample Input

9 

A 2 B 12 I 25 

B 3 C 10 H 40 I 8 

C 2 D 18 G 55 

D 1 E 44 

E 2 F 60 G 38 

F 0 

G 1 H 35 

H 1 I 35 

3 

A 2 B 10 C 40 

B 1 C 20 

0

Sample Output

216 

30

Source

Mid-Central USA 2002

#include<iostream>
#include<stdio.h>
#include<string.h>
#include<algorithm>
#define ll long long
using namespace std;
const int maxn = 30;
int vis[maxn];
int dis[maxn];
int Map[maxn][maxn];
int n,id,d;
char ch[2];
void prim()
{
    int sum=0;
    for(int i=0;i<n;i++)
        dis[i]=999999;
    for(int i=0;i<n;i++)
        dis[i]=Map[0][i];
    dis[0]=0;
    vis[0]=1;
    //int temp;

    for(int i=0;i<n-1;i++)
    {
        int temp=999999;
        int kase=0;
        for(int j=0;j<n;j++)
        {
            if(!vis[j]&&temp>=dis[j]){
                temp=dis[j];
                kase=j;
            }
        }
        if(temp!=999999) vis[kase]=1;
        sum+=dis[kase];
        for(int j=0;j<n;j++)
        {
            if(!vis[j]&&dis[j]>Map[kase][j])
            {
                dis[j]=Map[kase][j];
            }
        }

    }
    printf("%d\n",sum);
}
int main()
{
    while(scanf("%d",&n)!=EOF){
       // printf("%d\n",'A'-'B');
        if(n==0) break;
        memset(vis,0,sizeof(vis));
        for(int i=0;i<n;i++)
        {
            for(int j=0;j<n;j++)
                Map[i][j]=999999;
        }
        for(int i=0;i<n-1;i++)
        {
            scanf("%s %d",&ch,&id);
            int x=ch[0]-'A';
           // printf("%d %d\n",x,id);
            for(int k=0;k<id;k++){
                //    cout << k << endl;
                int y=0;
                scanf("%s",ch);
                scanf("%d",&d);
                y=ch[0]-'A';
                Map[x][y]=Map[y][x]=d;
            }
        }


        prim();
    }
    return 0;
}

Networking POJ - 1287

Language:Default

Networking

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 16099		Accepted: 8429

Description

You are assigned to design network connections between certain points in a wide area. You are given a set of points in the area, and a set of possible routes for the cables that may connect pairs of points. For each possible route between two points, you are given the length of the cable that is needed to connect the points over that route. Note that there may exist many possible routes between two given points. It is assumed that the given possible routes connect (directly or indirectly) each two points in the area.

Your task is to design the network for the area, so that there is a connection (direct or indirect) between every two points (i.e., all the points are interconnected, but not necessarily by a direct cable), and that the total length of the used cable is minimal.

Input

The input file consists of a number of data sets. Each data set defines one required network. The first line of the set contains two integers: the first defines the number P of the given points, and the second the number R of given routes between the points. The following R lines define the given routes between the points, each giving three integer numbers: the first two numbers identify the points, and the third gives the length of the route. The numbers are separated with white spaces. A data set giving only one number P=0 denotes the end of the input. The data sets are separated with an empty line.

The maximal number of points is 50. The maximal length of a given route is 100. The number of possible routes is unlimited. The nodes are identified with integers between 1 and P (inclusive). The routes between two points i and j may be given as i j or as j i.

Output

For each data set, print one number on a separate line that gives the total length of the cable used for the entire designed network.

Sample Input

1 0

2 3 

1 2 37 

2 1 17 

1 2 68

3 7 

1 2 19 

2 3 11 

3 1 7 

1 3 5 

2 3 89 

3 1 91 

1 2 32

5 7 

1 2 5 

2 3 7 

2 4 8 

4 5 11 

3 5 10 

1 5 6 

4 2 12

0

Sample Output

0 

17 

16 

26

Source

Southeastern Europe 2002

#include<iostream>
#include<stdio.h>
#include<string.h>
#include<algorithm>
#define ll long long
using namespace std;
const int maxn = 60;
int vis[maxn];
int dis[maxn];
int Map[maxn][maxn];
int n,m;//点的个数，路的个数
int A,B,d;//两点id,距离
void prim()
{
    int sum=0;
    for(int i=0;i<n;i++)
        dis[i]=999999;
    for(int i=0;i<n;i++)
        dis[i]=Map[0][i];
    dis[0]=0;
    vis[0]=1;
    //int temp;

    for(int i=0;i<n-1;i++)
    {
        int temp=999999;
        int kase=0;
        for(int j=0;j<n;j++)
        {
            if(!vis[j]&&temp>=dis[j]){
                temp=dis[j];
                kase=j;
            }
        }
        if(temp!=999999) vis[kase]=1;
        sum+=dis[kase];
        for(int j=0;j<n;j++)
        {
            if(!vis[j]&&dis[j]>Map[kase][j])
            {
                dis[j]=Map[kase][j];
            }
        }

    }
    printf("%d\n",sum);
}
int main()
{
    while(scanf("%d",&n)!=EOF){
       // printf("%d\n",'A'-'B');
        if(n==0) break;
        scanf("%d",&m);
        memset(vis,0,sizeof(vis));
        for(int i=0;i<n;i++)
        {
            for(int j=0;j<n;j++)
                Map[i][j]=999999;
        }
        for(int i=0;i<m;i++)
        {
            scanf("%d %d %d",&A,&B,&d);
            if(d<Map[A-1][B-1])
                Map[A-1][B-1]=Map[B-1][A-1]=d;
        }
        //for(int i=0;i<n;i++)
        //{
       //     for(int j=0;j<n;j++)
        //        printf("%d ",Map[i][j]);
//
         //   printf("\n");
        //}
        prim();
    }
    return 0;
}