Problem:
Disjoint Set

Write a program which manipulates a disjoint set S = {S1, S2, . . . , Sk}.

First of all, the program should read an integer n, then make a disjoint set where each element consists of 0, 1, ... n−1 respectively.

Next, the program should read an integer q and manipulate the set for q queries. There are two kinds of queries for different operations:

unite(x, y): unites sets that contain x and y, say Sx and Sy, into a new set.

same(x, y): determine whether x and y are in the same set.

Input

n q
com1 x1 y1
com2 x2 y2
...
comq xq yq

In the first line, n and q are given. Then, q queries are given where com represents the type of queries. '0' denotes unite and '1' denotes same operation.

Output

For each same operation, print 1 if x and y are in the same set, otherwise 0, in a line.

Constraints

1 ≤ n ≤ 10000

1 ≤ q ≤ 100000

x ≠ y

Sample Input

5 12
0 1 4
0 2 3
1 1 2
1 3 4
1 1 4
1 3 2
0 1 3
1 2 4
1 3 0
0 0 4
1 0 2
1 3 0

Sample Output

0
0
1
1
1
0
1
1

Solution in JAVA (judge verdict: Wrong Answer)




import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.Stack;
 

public class Main{
          
     public static void main(String args[]){
         BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
         
         try{ String line;
             while((line=br.readLine())!=null){if(line.isEmpty())break;
                String spl[]=line.split(" ");
                int n=Integer.parseInt(spl[0]),q=Integer.parseInt(spl[1]);
                int[] parent=new int[n];for(int i=0;i<n;i++)parent[i]=i;
                for(int i=0;i<q;i++){
                    line=br.readLine();spl=line.split(" "); int[] ns=new int[3];
                    for(int j=0;j<3;j++) ns[j]=Integer.parseInt(spl[j]);
                    if(ns[0]==0){//UNITE
                        if(parent[ns[1]]!=parent[ns[2]]){
                            for(int k=0;k<n;k++){
                                if(parent[k]==parent[ns[1]])
                                    parent[k]=parent[ns[2]];
                            }
                        }
                    }else{//Print
                        if(parent[ns[1]]==parent[ns[2]])System.out.println("1");
                        else System.out.println("0");
                    }
                }
                
             }
         }catch(Exception e){e.printStackTrace();}         
     }  
     
     
}