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<stdio.h> #include<iostream> #include<algorithm> #include<string.h> using namespace std; int n,m,sum; int f[30005]; int num[30005]; int find(int x) { if(f[x]==-1) return x; else return f[x]=find(f[x]); } int li(int x,int y) { x=find(x); y=find(y); if(x!=y) { f[x]=y; num[y]+=num[x]; } } int main() { scanf("%d%d",&n,&m); int h=0,t,x,k,y,g; int b[30005],a[30005]; memset(f,-1,sizeof(f)); fill(num,num+n+1,1); while(m--) { scanf("%d",&x); for(int i=1;i<=x;i++) { scanf("%d",&a[i]); if(i==1) continue; else li(a[i],a[i-1]); } } g=0; for(int i=0;i<n;i++) { if(f[i]==-1) b[h++]=i; } for(int i=0;i<n;i++) { if(num[i]>g) { g=num[i]; } } printf("%d",g); }