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 Ruby (judge verdict: Time Limit Exceeded)

# coding: utf-8
#lines = <<'EOS'
#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
#EOS

lines = $stdin.read

array = lines.split("\n")

n = array[0].split(" ")[0].to_i
q = array[0].split(" ")[1].to_i

i = -1
id = Array.new(n){i+=1}

for i in 1..q
  com = array[i].split(" ")[0]
  x   = array[i].split(" ")[1].to_i
  y   = array[i].split(" ")[2].to_i

  if com == '0'
    #puts "unite #{x}, #{y}"
    if id[x] != x
      id[y] = x
    else
      id[x] = y
    end

    #puts sn.to_s
    #puts id.to_s
    #puts ""
  else
    #puts "same #{x}, #{y} ?"
    # ???????????????root????±???????
    x_root = x
    y_root = y

    loop {
      if id[x] == x
        x_root = x
        break
      else
        x = id[x]
      end
    }
    loop {
      if id[y] == y
        y_root = y
        break
      else
        y = id[y]
      end
    }

    puts x_root == y_root ? "1" : "0"
  end
end