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.Linq;
using System.Collections.Generic;

class Program {

    const int inf = 2 << 29;
    const int MAX = 10000;
    const int wht = 0;
    const int gry = 1;
    const int blk = 2;
    static int[] clr = new int[MAX];

    static List<int>[] grp = new List<int>[MAX];


    static void Main(string[] args) {
        
        for (int i = 0; i < MAX; i++) {
            grp[i] = new List<int>();
        }

        var inp = Console.ReadLine().Split(' ').Select(z => int.Parse(z)).ToArray();
        int n, q; n = inp[0]; q = inp[1];

        var ds = new DisJoinSet(n);

        for (int i = 0; i < q; i++) {
            var c = Console.ReadLine().Split(' ').Select(z => int.Parse(z)).ToArray();
            if (c[0] == 0) {
                ds.unite(c[1], c[2]);
            }
            else {
                if (ds.same(c[1], c[2])) Console.WriteLine(1);
                else Console.WriteLine(0);
            }
        }


        
    }



    public class DisJoinSet {

        List<int> rank, p;

        public DisJoinSet() { }
        public DisJoinSet(int size) {
            rank = Enumerable.Repeat(0, size).ToList();
            p = Enumerable.Repeat(0, size).ToList();
            for (int i = 0; i < size; i++) {
                makeSet(i);
            }
        }

        public void makeSet(int x) {
            p[x] = x;
            rank[x] = 0;
        }

        public int findSet(int x) {
            if (x != p[x]) {
                p[x] = findSet(p[x]);
            }
            return p[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 (rank[x] > rank[y]) {
                p[y] = x;
            }
            else {
                p[x] = y;
                if (rank[x] == rank[y]) {
                    rank[y]++;
                }
            }
        }
    }
}