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 NNN (2≤N≤1042\le N\le 10^42≤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 NNN. 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.
result:
#include<stdio.h>
#include<stdlib.h>
int FINDS(int s);
void UNION(int c1,int c2);
int k;
int *a;
int main (void)
{
int num,c1,c2;
int i;
int find;
char kind;
scanf("%d",&num);
a=(int*)malloc(sizeof(int)*(num*1));
for(i=0;i<=num;i++)
{
a[i]=0;
}
while(1)
{
getchar();
scanf("%c",&kind);
find=0;
if(kind=='I')
{
scanf("%d%d",&c1,&c2);
UNION(c1,c2);
}
if(kind=='C')
{
scanf("%d%d",&c1,&c2);
if(FINDS(c1)==FINDS(c2))
printf("yes\n");
else
printf("no\n");
}
if(kind=='S')
break;
}
if(k>=num-1)
printf("The network is connected.");
else
{
printf("There are %d components.\n",num-k);
}
return 0;
}
int FINDS(int s)
{
if(a[s]==0)
return s;
else return a[s]=FINDS(a[s]);
}
void UNION (int c1,int c2)
{
if(FINDS(c1)==FINDS(c2))
;
else
{
a[c1]=c2;
k++;
}
}