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.util.ArrayList;
import java.util.Scanner;
public class Main{
    public static void main(String[] args) {
	Scanner scan = new Scanner(System.in);
        int n = scan.nextInt();
	int q = scan.nextInt();
	Union_Find_Tree u = new Union_Find_Tree(n);
	u.make();
	for(int i = 0; i < q; i++) {
	    int com = scan.nextInt();
	    int tree1 = scan.nextInt();
	    int tree2 = scan.nextInt();
	    u.union_judge(com,tree1,tree2);
	}
	for (int i : u.result) System.out.println(i);
    }
}
class Union_Find_Tree {
    int n,flag;
    ArrayList<Integer>tree = new ArrayList<Integer>();
    ArrayList<Integer>union = new ArrayList<Integer>();
    ArrayList<Integer>result = new ArrayList<Integer>();
    public Union_Find_Tree(int n){this.n = n;}

    void union_judge(int com, int tree1, int tree2) {
        if (com == 0) {
	    for(int i = 0; i < n; i++)
		if(union.get(tree2) == union.get(i))
		    union.set(i, union.get(tree1));
	}
	else
	    same(tree1,tree2);
    }
    
    void make() {
	for(int i = 0; i < n; i++) {
	    tree.add(i);
	    union.add(i);
	}
    }
    void same(int tree1, int tree2) {
	if(union.get(tree1) == union.get(tree2)) result.add(1);
	else result.add(0);
    }
}