Hdoj 1232 smooth engineering [parallel query]

Hdoj 1232 smooth engineering [parallel query]

Policy: for example, question.

Query set: the query set is a tree-type data structure used to process the merging and query of some Disjoint Sets. To put it bluntly, it is the merge and query of vertices.

Code:

 

# Include

 
  
# Include

  
   
Int fat [1005]; int f (int n) {if (fat [n]! = N) fat [n] = f (fat [n]); elsereturn fat [n];} int main () {int n, m, I; while (scanf (% d, & n), n) {scanf (% d, & m); for (I = 1; I <= n; I ++) fat [I] = I; int a, B; while (m --) {scanf (% d, & a, & B); int x = f (); int y = f (B); if (x! = Y) {// If the ancestor of a is not equal to the ancestor of B, the ancestor of B is equal to the ancestor of, in this way, the two sets are merged into a fat [y] = x ;}int ans = 0; for (I = 1; I <= n; I ++) if (fat [I] = I) ++ ans; printf (% d, ans-1);} return 0 ;}