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;

namespace ConsoleApplication1
{    
    class DisjoinSet
    {

        public DisjoinSet() { }

        static int[] rank;  
        static int[] p; 

        public DisjoinSet(int n)
        {
            MakeSet(n);
        }

        static void MakeSet(int n)
        {
            p = new int[n];
            rank = new int[n];
            for(int i = 0; i < n; i++)
            {
                p[i] = i;  
            }           
        }

        public void Unite(int x, int y)
        {
            Linke(FindSet(x), FindSet(y));
        }


        
        public void Linke(int x, int y)
        {
            if(rank[x] < rank[y])
            {
                p[x] = y;
            }
            else
            {
                p[y] = x;
                if(rank[x] == rank[y])
                {
                    rank[x]++;
                }
            }

        }


       
        public bool Same(int x, int y)
        {
            return FindSet(x) == FindSet(y);
        }


        
        public int FindSet(int x)
        {
            
            if(x != p[x])
            {
                p[x] = FindSet(p[x]);
            }
            return p[x];
        }

    }


    
    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 x;
            int y;
            int order;

            DisjoinSet a = new DisjoinSet(n);

            for(int i = 0; i < q; i++)
            {
                input = Console.ReadLine().Split(' ');
                order = int.Parse(input[0]);
                x = int.Parse(input[1]);
                y = int.Parse(input[2]);

                if(order == 0)
                {
                    a.Unite(x, y);
                }
                else if(order == 1)
                {
                    if(a.Same(x, y))
                    {
                        Console.WriteLine(1);
                    }
                    else
                    {
                        Console.WriteLine(0);
                    }
                }
            }



        }
    }
}