Jungle Roads解题分析（并查集，最小生成树，输入格式）

题目描述

    <center> < /center>     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.

输入描述:

    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.

输出描述:

    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.

输入例子:

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

输出例子:

216

30

错误代码：

#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<math.h>
using namespace std;

struct edge {
	int a, b;
	int num;
	bool operator < (const edge &A)const
	{
		return num < A.num;
	}
}buf[1001];

int T[1001];
int findroot(int x)
{
	if (T[x] == -1)return x;
	else
	{
		int temp = findroot(T[x]);
		T[x] = temp;
		return temp;
	}
}

int n, m, i, j, k;
int main()
{
	while (scanf("%d", &n) != EOF&&n!=0)
	{
		n--;
		k = 0;
		for (i = 0; i < 1001; i++)
		{
			buf[i].a = 0;
			buf[i].b = 0;
			buf[i].num = 0;
		}
		for (i = 0; i < n; i++)
		{
			char c;
			c=getchar();//这里有问题
			scanf("%c", &c);//这里有问题
			scanf("%d", &m);//这里有问题
			for (j = 0; j < m; j++)
			{
				char d;
				d = getchar();//这里有问题
				scanf("%c", &d);//这里有问题
				buf[k].a = c-'A';
				buf[k].b = d-'A';
				scanf("%d", &buf[k].num);
				k++;
			}
		}
		sort(buf, buf + k);
		for (i = 0; i < 1001; i++)
			T[i] = -1;
		int sum = 0;
		for (i = 0; i < k; i++)
		{
			int a = findroot(int(buf[i].a));
			int b = findroot(int(buf[i].b));
			if (a != b)
			{
				if (a > b)
					T[a] = b;
				else
					T[b] = a;
				sum += buf[i].num;
			}
		}
		printf("%d\n", sum);
	}
	return 0;
}

错误显示：

答案错误:您提交的程序没有通过所有的测试用例
case通过率为0.00%

测试用例:
7

对应输出应该为:

228

你的输出为:

281

正确代码：

#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<math.h>
using namespace std;
 
struct edge {
    int a, b;
    int num;
    bool operator < (const edge &A)const
    {
        return num < A.num;
    }
}buf[1001];
 
int T[1001];
int findroot(int x)
{
    if (T[x] == -1)return x;
    else
    {
        int temp = findroot(T[x]);
        T[x] = temp;
        return temp;
    }
}
 
int n, m, i, j, k;
int main()
{
    while (scanf("%d", &n) != EOF&&n!=0)
    {
        n--;
        k = 0;
        for (i = 0; i < 1001; i++)
        {
            buf[i].a = 0;
            buf[i].b = 0;
            buf[i].num = 0;
        }
        for (i = 0; i < n; i++)
        {
            char c;
            //c=getchar();
            //scanf("%c", &c);
            //scanf("%d", &m);
            cin >> c >> m;
            for (j = 0; j < m; j++)
            {
                char d;
                cin >> d;
                buf[k].a = c-'A';
                buf[k].b = d-'A';
                scanf("%d", &buf[k].num);
                k++;
            }
        }
        sort(buf, buf + k);
        for (i = 0; i < 1001; i++)
            T[i] = -1;
        int sum = 0;
        for (i = 0; i < k; i++)
        {
            int a = findroot(int(buf[i].a));
            int b = findroot(int(buf[i].b));
            if (a != b)
            {
                if (a > b)
                    T[a] = b;
                else
                    T[b] = a;
                sum += buf[i].num;
            }
        }
        printf("%d\n", sum);
    }
    return 0;
}

程序分析：

本程序考察并查集的应用，用最小生成树算法，输入格式特别重要。例如上述错误代码，虽然能够通过测试题目给出的样例，但是如果样例格式稍微多个空格，则会出现错误，所以一直无法通过

使用cin输入，可以将换行符和空格过滤掉，特别好用。