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≤104), 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>
#include <set>
#define MAX 10005
using namespace std;
int parent[MAX];
int a, b;
int n;
char c;
void init() //初始化,自己是自己的父亲
{
for(int i=1; i<=n; i++)
parent[i] = i;
}
int Find(int x)
{
int root = x;
while(parent[root] != root) //找祖先
root = parent[root];
while(parent[x] != root) //路径压缩
{
int temp = parent[x]; //parent[x]是x的父亲
parent[x] = root; //让后代们都指向祖先
x = temp;
}
return root;
}
void unio(int x, int y)
{
int t1 = Find(x);
int t2 = Find(y);
if(t1 != t2)
parent[t1] = t2;
}
int main()
{
cin >> n;
init();
while(1)
{
cin >> c;
if(c == 'I')
{
cin >> a >> b;
unio(a, b);
}
else if(c == 'C')
{
cin >> a >> b;
if(Find(a) == Find(b))
cout << "yes" << endl;
else
cout << "no" << endl;
}
else if(c == 'S')
break;
}
set<int> s;
for(int i=1; i<=n; i++)
s.insert(Find(i));
if(s.size() == 1)
cout << "The network is connected." << endl;
else
cout << "There are "<< s.size() <<" components." << endl;
return 0;
}