Problem:
Score : 100 points

Problem Statement

You are given an undirected graph with N vertices and 0 edges. Process Q queries of the following types.

0 u v: Add an edge (u, v).

1 u v: Print 1 if u and v are in the same connected component, 0 otherwise.

Constraints

1 \leq N \leq 200,000

1 \leq Q \leq 200,000

0 \leq u_i, v_i \lt N

Input

Input is given from Standard Input in the following format:

N Q
t_1 u_1 v_1
t_2 u_2 v_2
:
t_Q u_Q v_Q

出力

For each query of the latter type, print the answer.

Sample Input 1

4 7
1 0 1
0 0 1
0 2 3
1 0 1
1 1 2
0 0 2
1 1 3

Sample Output 1

0
1
0
1

Solution in C# (.NET Core 3.1.201) (judge verdict: Accepted)

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

namespace AtCoder.ALCP
{
    class DisjointSet
    {
        private int[] rank;
        private int[] parent;

        public DisjointSet() { }
        public DisjointSet(int size)
        {
            rank = new int[size];
            parent = new int[size];
            for (int i = 0; i < size; i++)
            {
                MakeSet(i);
            }
        }

        public void MakeSet(int x)
        {
            parent[x] = x;
            rank[x] = x;
        }

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

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

        public void Link(int x, int y)
        {
            if (x == y) return;
            if (rank[x] > rank[y]) { parent[y] = x; }
            else
            {
                parent[x] = y;
                if (rank[x] == rank[y])
                {
                    rank[y]++;
                }
            }
        }
        public int FindSet(int x)
        {
            if (x != parent[x]) parent[x] = FindSet(parent[x]);
            return parent[x];
        }
    }
    public class Question
    {
        public static void Main(string[] args)
        {
            new Question().Solve(new ConsoleInput(Console.In, ' '));
        }

        public void Solve(ConsoleInput cin)
        {
            var n = cin.ReadInt;
            var q = cin.ReadInt;
            var ds = new DisjointSet(n);
            for (int i = 0; i < q; i++)
            {
                var t = cin.ReadInt;
                var u = cin.ReadInt;
                var v = cin.ReadInt;
                if(t == 0){
                    ds.Unite(u, v);
                }else
                {
                    Console.WriteLine(ds.Same(u, v) ? 1 : 0);
                }
            }
        }

        public class ConsoleInput
        {
            private readonly System.IO.TextReader _stream;
            private char _separator = ' ';
            private Queue<string> inputStream;
            public ConsoleInput(System.IO.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; }
        }
    }
}