05-ツリー8 File Transfer(25分)

05-ツリー8 File Transfer(25分)
We have a network of computters 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 computter on the network?
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 network.Each computer in the network is then represented by the the initine.the infove line.The.The.the infont infont intwent.The.

I c1 c2  

where I stands for inputting a connection betwen c1 and c2;or

C c1 c2    

where C stands for checking if it is possible to transfiles 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,respively.At the end of each case,print ine one line「The nectweres.」or「The re 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.

 
考えをかきたてる簡単にセットを調べて、配列でコンピューターの番号を保存しますが、桁が違っています.たとえば、配列0は1号機を貯蓄しています.この位置がずれていることに注意してください.

#include
#include
using namespace std;
int N;
int Find(int* S,int X)
{
	if(S[X]<0)	return X;
	else	return S[X]=Find(S,S[X]);//    ，         ，       */
}
void Union(int* S,int X1,int X2)
{
	int root1=Find(S,X1-1);
	int root2=Find(S,X2-1);
	if(root1==root2)
	{
		S[root2]=root1;
		root1-=root2;
	}
	else
	{
		//     
		if(root1>x1>>x2;
	Union(S,x1,x2);
}
void Check_connection(int* S)
{
	int x1,x2;
	cin>>x1>>x2;
	int root1,root2;
	root1=Find(S,x1-1);
	root2=Find(S,x2-1);
	if(root1==root2)
		cout<>N;
	int S[N];
	for(int i=0;i>c;
		switch(c)
		{
			case 'C':	Check_connection(S);break;
			case 'S':	Check_network(S,N);break; 
			case 'I':	Input_connection(S);break;
		}
	}while(c!='S');
	return 0;
}