Getting started with algorithm notes and query set POJ 1611

Description

Severe acute respiratory syndrome (SARS), an atypical ppneumonia onia of unknown aetiology, was recognized as a global threat in mid-March 2003. to minimize transmission to others, the best strategy is to separate the suspects from others.
In the Not-Spreading-Your-Sickness University (NSYSU), there are still student groups. students in the same group intercommunicate with each other frequently, and a student may join several groups. to prevent the possible transmissions of SARS, the NSYSU collects the member lists of all student groups, and makes the following rule in their standard operation procedure (SOP ).
Once a member in a group is a suspect, all members in the group are suspects.
However, they find that it is not easy to identify all the suspects when a student is recognized as a suspect. Your job is to write a program which finds all the suspects.
Input

The input file contains several cases. each test case begins with two integers n and m in a line, where n is the number of students, and m is the number of groups. you may assume that 0 <n <= 30000 and 0 <= m <= 500. every student is numbered by a unique integer between 0 and n −1, and initially student 0 is recognized as a suspect in all the cases. this line is followed by m member lists of the groups, one line per group. each line begins with an integer k by itself representing the number of members in the group. following the number of members, there are k integers representing the students in this group. all the integers in a line are separated by at least one space.
A case with n = 0 and m = 0 indicates the end of the input, and need not be processed.
Output

For each case, output the number of suspects in one line.
Sample Input

100 4
2 1 2
5 10 13 11 12 14
2 0 1
2 99 2
200 2
1 5
5 1 2 3 4 5
1 0
0 0 Sample Output

4
1
1

For more information, see google. I will only post code. Sorry ~

[Cpp]
# Include <iostream>
Using namespace std;
Int father [30001]; // store father index
Int group [30001]; // Number of people who store the current set
// Initialization
Void init (int len ){
For (int I = 0; I <= len; I ++ ){
Father [I] = I;
Group [I] = 1;
}
}
// Find the final father of I
Int find_set (int I ){
If (I! = Father [I]) {
Father [I] = find_set (father [I]); // path compression
}
Return father [I];
}
// Merge two vertices
Void join (int x, int y ){
Int I = find_set (x );
Int j = find_set (y );
If (I! = J ){
Father [I] = father [j];
Group [j] + = group [I]; // when merging, the current set count is saved by the final father.
 
}
}
 
Int main (){
Int n, m, k;
While (cin> n> m ){
If (n = 0)
Break;
Init (n); // Initialization
For (int I = 0; I <m; I ++ ){
Cin> k;
Int pre, cur; // the previous and current
For (int j = 0; j <k; j ++ ){
Cin> cur;
If (j) // ignore the first number
Join (pre, cur );
Pre = cur;
}
}
// Test
// For (int I = 0; I <n; I ++)
// Cout <father [I] <"";
// Cout <endl;
//
// For (int I = 0; I <n; I ++)
// Cout <group [I] <"";
// Cout <endl;
//
// Cout <find_set (0) <endl;
Cout <group [find_set (0)] <endl;
}
Return 0;
}

# Include <iostream>
Using namespace std;
Int father [30001]; // store father index
Int group [30001]; // Number of people who store the current set
// Initialization
Void init (int len ){
For (int I = 0; I <= len; I ++ ){
Father [I] = I;
Group [I] = 1;
}
}
// Find the final father of I
Int find_set (int I ){
If (I! = Father [I]) {
Father [I] = find_set (father [I]); // path compression
}
Return father [I];
}
// Merge two vertices
Void join (int x, int y ){
Int I = find_set (x );
Int j = find_set (y );
If (I! = J ){
Father [I] = father [j];
Group [j] + = group [I]; // when merging, the current set count is saved by the final father.

}
}

Int main (){
Int n, m, k;
While (cin> n> m ){
If (n = 0)
Break;
Init (n); // Initialization
For (int I = 0; I <m; I ++ ){
Cin> k;
Int pre, cur; // the previous and current
For (int j = 0; j <k; j ++ ){
Cin> cur;
If (j) // ignore the first number
Join (pre, cur );
Pre = cur;
}
}
// Test
// For (int I = 0; I <n; I ++)
// Cout <father [I] <"";
// Cout <endl;
//
// For (int I = 0; I <n; I ++)
// Cout <group [I] <"";
// Cout <endl;
//
// Cout <find_set (0) <endl;
Cout <group [find_set (0)] <endl;
}
Return 0;
}
Running time: 47 ms is too slow. Optimize recursion and input/output:

[Cpp]
# Include <stdio. h>
Int father [30001]; // store father index
Int group [30001]; // Number of people who store the current set
 
// Initialization
Void init (int len ){
For (int I = 0; I <= len; I ++ ){
Father [I] = I;
Group [I] = 1;
 
}
}
// Find the final father of I
Int find_set (int I ){
Int temp = I;
While (temp! = Father [temp]) {
Temp = father [temp];
}
Father [I] = temp;
Return temp;
// If (I! = Father [I]) {
// Father [I] = find_set (father [I]); // path compression
//}
// Return father [I];
}
// Merge two vertices
Void join (int x, int y ){
Int I = find_set (x );
Int j = find_set (y );
If (I! = J ){
Father [I] = father [j];
Group [j] + = group [I]; // when merging, the current set count is saved by the final father.
}
}
 
Int main (){
Int n, m, k;
While (scanf ("% d", & n, & m )! = EOF ){
If (n = 0)
Break;
Init (n); // Initialization
For (int I = 0; I <m; I ++ ){
Scanf ("% d", & k );
Int pre, cur; // the previous and current
For (int j = 0; j <k; j ++ ){
Scanf ("% d", & cur );
If (j) // ignore the first number
Join (pre, cur );
Pre = cur;
}
}
// Test
// For (int I = 0; I <n; I ++)
// Cout <father [I] <"";
// Cout <endl;
//
// For (int I = 0; I <n; I ++)
// Cout <group [I] <"";
// Cout <endl;
//
// Cout <find_set (0) <endl;
Printf ("% d \ n", group [find_set (0)]);
 
}
Return 0;
}