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: Runtime Error)

import java.util.Scanner;
import java.util.ArrayList;

class ProblemA{
  void solve(){
    Scanner scan = new Scanner(System.in);
    int n = scan.nextInt();
    int q = scan.nextInt();

    DisjointSet ds = new DisjointSet(n);

    for(int i=0 ; i<q ; ++i){
      int com = scan.nextInt();
      int x = scan.nextInt();;
      int y = scan.nextInt();

      if(com == 0) ds.union(x, y);
      else if(com == 1){
        if(ds.same(x, y)) System.out.println("1");
        else System.out.println("0");
      }
    }//---- end of loop ----
  }//---- end of solve ----
}

class DisjointSet{
  ArrayList<Integer> rank = null;
  ArrayList<Integer> p = null;

  DisjointSet(){}
  DisjointSet(int size){
    rank = new ArrayList<Integer>(size);
    p = new ArrayList<Integer>(size);

    for(int i=0 ; i<size ; ++i){
      makeSet(i);
    }
  }

  void makeSet(int x){
    p.add(x);
    rank.add(0);
  }

  void union(int x, int y){
    link(findSet(x), findSet(y));
  }

  void link(int x, int y){
    if(rank.get(x) > rank.get(y)){
      p.set(x, y);
    }
    else{
      p.set(x, y);
      if(rank.get(x) == rank.get(y)){
        rank.set(y, y+1);
      }
    }
  }

  boolean same(int x, int y){
    return findSet(x) == findSet(y);
  }

  int findSet(int x){
    if(x != p.get(x)){
        p.set(x, findSet(p.get(x)));
    }
    return p.get(x);
  }
}//----end of class DisjointSet


public class Main{
  public static void main(String[] args){
    new ProblemA().solve();
  }
}