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
4
), 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
S
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:
5
C 3 2
I 3 2
C 1 5
I 4 5
I 2 4
C 3 5
S
Sample Output 1:
no
no
yes
There are 2 components.
Sample Input 2:
5
C 3 2
I 3 2
C 1 5
I 4 5
I 2 4
C 3 5
I 1 3
C 1 5
S
Sample Output 2:
no
no
yes
yes
The network is connected.
//并查集操作的优化
#include <iostream>
#define MaxNum 10000
using namespace std;
//初始化并查集
void Init(int parent[],int n)
{
for (int i = 1; i <= n; i++)
parent[i] = -1;
}
//查找
int Find(int parent[], int x)
{
if (parent[x] < 0)
return x;
else
return parent[x] = Find(parent, parent[x]);
}
//并
void Union(int parent[], int root1, int root2)
{
if (parent[root1] < parent[root2])
{
parent[root1] += parent[root2];//规模加大
parent[root2] = root1;
}
else
{
parent[root2] += parent[root1];
parent[root1] = root2;
}
}
//连接
void Input_Connection(int parent[])
{
int x1, x2;
cin >> x1 >> x2;
int root1 = Find(parent, x1);
int root2 = Find(parent, x2);
if(root1!=root2)
Union(parent, root1, root2);
}
//检查
void Check_Connection(int parent[])
{
int x1, x2;
cin >> x1 >> x2;
int root1 = Find(parent, x1);
int root2 = Find(parent, x2);
if (root1 != root2)
cout << "no" << endl;
else
cout << "yes" << endl;
}
//检查网络
void Check_Network(int parent[],int n)
{
int count=0;
for (int i = 1; i <= n; i++)
if (parent[i] < 0)
count++;
if (count == 1)
cout << "The network is connected." << endl;
else
cout << "There are " << count << " components." << endl;
}
int main()
{
int parent[MaxNum];
int n;
cin >> n;
char in;
Init(parent, n);
do
{
cin >> in;
switch (in)
{
case 'I':Input_Connection(parent); break;
case 'C':Check_Connection(parent); break;
case 'S':Check_Network(parent, n); break;
}
}while(in != 'S');
return 0;
}