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 Scala (judge verdict: Accepted)

import scala.collection.mutable
import scala.io.StdIn._

case class UnionFind(parent: mutable.Seq[Int], rank: mutable.Seq[Int]) {

  def root(i: Int): Int = {
    if (parent(i) == i) return i
    parent(i) = root(parent(i))
    parent(i)
  }

  def same(x: Int, y: Int): Boolean = root(x) == root(y)

  def unite(x: Int, y: Int): Unit = {
    val _x = root(x)
    val _y = root(y)
    if (_x == _y) return

    if (rank(_x) < rank(_y)) parent(_x) = _y
    else {
      parent(_y) = _x
      if (rank(_x) == rank(_y)) rank(_x) += 1
    }
  }

}

object Main extends App {
  val Array(n, q) = readLine().split(" ").map(_.toInt)
  val uf = UnionFind(mutable.Seq.fill(n)(0), mutable.Seq.fill(n)(0))

  for (i <- 0 until n) {
    uf.parent(i) = i
  }

  for (i <- 1 to q) {
    val Array(com, x, y) = readLine().split(" ").map(_.toInt)
    com match {
      case 0 => uf.unite(x, y)
      case _ => if (uf.same(x, y)) println(1) else println(0)
    }
  }
}