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.IO;
using System.Linq;
using System.Text;

namespace CsharpSpiral {
    partial class Program {
        static void Main(string[] args) {
            var sw = new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = true };
            Console.SetOut(sw);
            new Program().Solve(new ConsoleInput(Console.In, ' '));
            Console.Out.Flush();
        }
        public void Solve(ConsoleInput cin) {
            var UFF = new UnionFindForest();
            var N = cin.ReadInt;
            var Q = cin.ReadInt;
            for(int j = 0; j < N; j++) 
                UFF.Add(j);
            for(int i = 0; i < Q; i++) {
                var com = cin.ReadInt == 1;
                var x = cin.ReadInt;
                var y = cin.ReadInt;
                if(com)
                    Console.WriteLine(UFF.Find(x, y) ? 1 : 0);
                else
                    UFF.Union(x, y);
            }
        }

    }

    class UnionFindForest {
        public class Node {
            public int value { get; set; }
            public Node parent { get; set; }
            public Node root {
                get {
                    var path = new Queue<Node>();
                    var res = this;
                    while(res.parent != res) {
                        path.Enqueue(res);
                        res = res.parent;
                    }
                    while(path.Any()) 
                        path.Dequeue().parent = res;
                    return res;
                }
            }
            public int rank{ get; private set; }    //meanful iff this is root
            public void rankIncrement() => rank++;
            public Node(int thisValue) {
                value = thisValue;
                parent = this;
                rank = 1;
            }
        }
        Dictionary<int, Node> switchBoard = new Dictionary<int, Node>();
        public void Union(int x, int y) => Union(switchBoard[x], switchBoard[y]);
        public void Union(Node X, Node Y) {
            var RX = X.root;
            var RY = Y.root;
            switch(RX.rank.CompareTo(RY.rank)) { 
                case 1:
                    RY.parent = RX;
                    break;
                case -1:
                    RX.parent = RY;
                    break;
                default:
                    RX.parent = RY;
                    RY.rankIncrement();
                    break;
            }
        }
        public bool Find(int x, int y) => Find(switchBoard[x], switchBoard[y]);
        public bool Find(Node X, Node Y) => X.root == Y.root;
        public void Add(int id) {
            var N = new Node(id);
            switchBoard.Add(id, N);
        }
    }

    static class ExtendClass {
        public static void Swap<T>(this T[] X, int i, int j) {
            T tmp = X[i];
            X[i] = X[j];
            X[j] = tmp;
        }
        public static string Join<T>(this T[] X, string separator = " ") => string.Join(separator, X);
        public static S[] Clone<S>(this S[] src) where S : struct {
            var res = new S[src.Length];
            Array.Copy(src, res, src.Length);
            return res;
        }
    }

    class ConsoleInput {
        private readonly TextReader _stream;
        private char _separator = ' ';
        private Queue<string> inputStream;
        public ConsoleInput(TextReader stream, char separator = ' ') {
            this._separator = separator;
            this._stream = stream;
            inputStream = new Queue<string>();
        }
        public string Read {
            get {
                if(inputStream.Count != 0) return inputStream.Dequeue();
                string[] tmp = _stream.ReadLine().Split(_separator);
                for(int i = 0; i < tmp.Length; ++i)
                    inputStream.Enqueue(tmp[i]);
                return inputStream.Dequeue();
            }
        }
        public string ReadLine { get { return _stream.ReadLine(); } }
        public int ReadInt { get { return int.Parse(Read); } }
        public long ReadLong { get { return long.Parse(Read); } }
        public double ReadDouble { get { return double.Parse(Read); } }
        public string[] ReadStrArray(long N) {
            var ret = new string[N];
            for(long i = 0; i < N; ++i)
                ret[i] = Read;
            return ret;
        }
        public int[] ReadIntArray(long N) { var ret = new int[N]; for(long i = 0; i < N; ++i) ret[i] = ReadInt; return ret; }
        public long[] ReadLongArray(long N) { var ret = new long[N]; for(long i = 0; i < N; ++i) ret[i] = ReadLong; return ret; }
    }
}