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

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;

namespace Set___Disjoint_Set_Union_Find_Tree
{
    class Program
    {
        static void Main(string[] args)
        {
            string[] input = Console.ReadLine().Split(' ');
            int n = int.Parse(input[0]);
            int q = int.Parse(input[1]);
            int[] nums = new int[n];
            for (int i = 0; i < n; ++i)
            {
                nums[i] = i;
            }
            for (int i = 0; i < q; ++i)
            {
                string[] temp = Console.ReadLine().Split(' ');
                int com = int.Parse(temp[0]);
                int x = int.Parse(temp[1]);
                int y = int.Parse(temp[2]);
                int t;
                if (x > y)
                {
                    t = y;
                    y = x;
                    x = t;
                }
                if (com == 0)
                {
                    int t1 = nums[x];
                    int t2 = nums[y];
                    for (int j = 0; j < nums.Length; ++j)
                    {
                        if (nums[j] == t2)
                        {
                            nums[j] = t1;
                        }
                    }

                }


                if (com == 1)
                {

                    if (nums[y] == nums[x]) Console.WriteLine(1);                    
                    else Console.WriteLine(0);
                }
            }
        }
    }
}