Fzu2192, type and query set

Fzu2192, type and query set

If the meaning of the question is Chinese, it will not be said;

Here the use of types and query set, respectively with 1-N; N-2N, 2N-3N represents the city, service, people;

Pay attention to the following points:

1: Do not use the rank array, because the edge must be controlled by yourself.

2: when using the unite function, compare x and y to control large connections to small ones. In this way, find () it will find the smallest (city), and if it is greater than N, it means that it is not connected to the city, and the output is 0;

 

The Code is as follows:

 

# Include

 
  
# Include

  
   
# Include

   
    
# Include

    
     
# Include

     
      
Using namespace std; const int N = 300000; int par [999999], last [999999]; void init (int n) {int I, j; for (int I = 0; I

      
        N) {printf ("0 \ n"); continue;} printf ("% d \ n", temp) ;}} return 0 ;}