05-树7. File Transfer (25)

最新推荐文章于 2022-12-18 01:45:29 发布

G____yiyi

最新推荐文章于 2022-12-18 01:45:29 发布

阅读量939

点赞数

分类专栏： PAT解题报告文章标签： c 递归遍历

本文链接：https://blog.csdn.net/yiyi__baby/article/details/45267451

版权

PAT解题报告专栏收录该内容

9 篇文章 0 订阅

订阅专栏

05-树7. File Transfer (25)

时间限制

150 ms

内存限制

65536 kB

代码长度限制

8000 B

判题程序

Standard

作者

CHEN, Yue

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." where k 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.

思路：典型的并查集问题，关键问题是搜索效率的提高。

采用两种方法：1.按秩合并---何头课程中有讲到，将较小的高度的集合并到大集合中，这样不会增加树的高度，只有在高度相同的时候树高度会加1；

2.路径压缩---在查找根结点的时候顺便把他的“孙子辈”都直接连到他上面

TIP:更详细的分析可自行搜索维基百科---并查集.

#include<iostream>
using namespace std;

int *x;//定义全局变量可以在调用函数时少用一个参数，小代码会显得简洁，不适合大型代码

int FindRoot(int item);
void Union(int num1, int num2);

int main(int argc, char *argv[])
{	
		int MaxSize;
		cin >> MaxSize;
		x = new int[MaxSize + 1];
		//MakeSet
		for (int i = 0; i <= MaxSize; i++)
			x[i] = i;
		while (1)
		{
			char order;
			cin >> order;
			if ('S' == order)
				break;
			int num1, num2;
			cin >> num1 >> num2;
			if ('I' == order)
				Union(num1, num2);
			if ('C' == order)
			{
				if (FindRoot(num1) == FindRoot(num2))
					cout << "yes" << endl;
				else
					cout << "no" << endl;
			}
		}

		int cnt = 0;
		for (int i = 1; i <= MaxSize; i++)
		{
			if (x[i] == i)
				cnt++;
		}
		if (1 == cnt)
			cout << "The network is connected." << endl;
		else
			cout << "There are " << cnt << " components." << endl;

	system("pause");
	return 0;
}

int FindRoot(int item)
{
	if (item != x[item])
		x[item] = FindRoot(x[item]);//路径压缩
	return x[item];	
}

void Union(int num1, int num2)
{
	int root1, root2;
	root1 = FindRoot(num1);
	root2 = FindRoot(num2);
	if (root1 != root2)
	{
		if (root1 < root2)
			x[root2] = root1;
		else
			x[root1] = root2;//按秩合并
	}
}