05-树8 File Transfer (25分)
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≤10e+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.
main函数控制输入输出
立了个flag判断是否需要结束输入;
int main()
{
cin>>N;
for(int i=1;i<=N;i++)
{
result[i]=-1;
}
int flag=0;
while(cin>>cmd){
if(cmd!='S')
cin>>a>>b;
switch(cmd){
case 'C':
Check(a,b);
break;
case 'I':
Input(a,b);
break;
case 'S':
Stop();
flag=1;
break;
}
if(flag)
break;
}
}
来一波对比,看一下和老师答案main函数的区别
int main()
{
SetType S;
int n;
char in;
scanf("%d\n",&n);
Initialization(S,n); //初始化S——为-1
do{
scanf("%c",&in);
switch(in)
{
case 'I':Input_connection(S);break;
case 'C':Check_connection(S);break;
case 'S':Check_network(S,n);break;
}
}
while(in != 'S');
return 0;
}
用do while,将终止条件放进while中,可以省去标志符号flag;
input 函数,进行了按秩归并
将小的集合放入大的集合内,以减缓树的高度
void Input(int a,int b){
while(result[a]>0) a=result[a