PAT 05-树7. File Transfer (25)

最新推荐文章于 2020-04-11 12:32:44 发布

ly348533639

最新推荐文章于 2020-04-11 12:32:44 发布

阅读量491

点赞数

分类专栏：中国大学MOOC-陈越、何钦铭-数据结构习题集

本文链接：https://blog.csdn.net/ly348533639/article/details/45582227

版权

中国大学MOOC-陈越、何钦铭-数据结构习题集专栏收录该内容

1 篇文章 0 订阅

订阅专栏

该问题涉及一个由N台电脑组成的网络，每台电脑用1到N的正整数表示。输入包含双向连接，用于在电脑间传输文件。任务是判断任意两台电脑间能否传输文件，并在最后给出网络的连通性状态。

摘要由CSDN通过智能技术生成

We have a network of computers and a list of bi-directional connections. Each of these connections allows a file transfer from one computer to another. Is it possible to send a file from any computer on the network to any other?

Input Specification:

Each input file contains one test case. For each test case, the first line contains N (2<=N<=10⁴), the total number of computers in a network. Each computer in the network is then represented by a positive integer between 1 and N. Then in the following lines, the input is given in the format:

I c1 c2

where I stands for inputting a connection between c1 and c2; or

C c1 c2

where C stands for checking if it is possible to transfer files between c1 and c2; or

where S stands for stopping this case.

Output Specification:

For each C case, print in one line the word "yes" or "no" if it is possible or impossible to transfer files between c1 and c2, respectively. At the end of each case, print in one line "The network is connected." if there is a path between any pair of computers; or "There are k components." wherek is the number of connected components in this network.

Sample Input 1:

Sample Output 1:

no
no
yes
There are 2 components.

Sample Input 2:

Sample Output 2:

no
no
yes
yes
The network is connected.

#include <stdio.h>
#include <stdlib.h>

#define ElementType int

typedef struct
{
	ElementType Data;
	int parent;
}SetType;

SetType* Create(int Size)
{
	SetType* S;
	int i;
	
	S = (SetType*)malloc(Size * sizeof(SetType));
	
	for(i = 0; i < Size; i++)
	{
		S[i].Data = i + 1;
		S[i].parent = -1;
	}
	
	return S;
}

int Find(SetType* S, ElementType a)
{
	int i = a - 1;
	if(S[i].parent < 0)
	{
		return i;
	}
	else
	{
		return Find(S, S[S[i].parent].Data);
	}
}

int Union(SetType* S, ElementType a, ElementType b)
{
	int ra, rb;

	ra = Find(S, a);
	rb = Find(S, b);
	if(ra != rb)
	{
		if(S[ra].parent > S[rb].parent)
		{
			S[ra].parent = rb;
			S[rb].parent--;
		}
		else
		{
			S[rb].parent = ra;
			S[ra].parent--;
		}		
		return 1;
	}	
	else
		return 0;	
}

int main()
{
	int N;
	char c;
	int a, b;
	int ra, rb;
	int i;
	int count,flag;
	SetType* S;
	scanf("%d", &N);
	
	S = Create(N);

	count = N;
	while(1)
	{
		scanf("%c", &c);
		
		if(c == 'C')
		{
			scanf("%d %d", &a, &b);
			ra = Find(S, a);
			rb = Find(S, b);
			if(ra == rb)
			{
				printf("yes\n");
			}
			else
			{
				printf("no\n");
			}
		}
		else
		if(c == 'I')
		{
			scanf("%d %d", &a, &b);
			flag = Union(S, a, b);
			if(flag == 1)
				count--;
		}
		else
		if(c == 'S')
		{
			break;
		}
	}
	
	if(count == 1)
		printf("The network is connected.");
	else
		printf("There are %d components.", count);
	
	return 0;
}