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++14 (judge verdict: Accepted)

#include <bits/stdc++.h>

using namespace std;

class DisjointSet 
{
    unordered_map<int, int> parent;
    unordered_map<int, int> rank;
    
    public:
        void makeSet(vector<int> const &universe)
        {
            for(int i : universe)
            {
                parent[i] = i;
                rank[i] = 0;
            }
        }
        
        int find(int k)
        {
            return (parent[k] == k) ? k : parent[k] = find(parent[k]);
        }
        
        bool isSameSet(int x, int y)
        {
            return find(x) == find(y);
        }
        
        void unionSet(int a, int b)
        {
            int x = find(a);
            int y = find(b);
            
            if(x == y)
            {
                return;
            }
            if(rank[x] > rank[y])
            {
                parent[y] = x;
            } 
            else if(rank[x] < rank[y])
            {
                parent[x] = y;
            }
            else
            {
                parent[x] = y;
                rank[y]++;
            }
        }
};

int main() 
{
    int n, q, c, x, y;
    scanf("%d %d", &n, &q);
    
    vector<int> universe;
    
    for(int i = 0; i < n; i++)
    {
        universe.emplace_back(i);
    }
    
    DisjointSet ds;
    ds.makeSet(universe);
    
    for(int i = 0; i < q; i++)
    {
        scanf("%d %d %d", &c, &x, &y);
        
        if(c == 0)
        {
            ds.unionSet(x, y);
        }
        else if(c == 1)
        {
            printf("%d\n", ds.isSameSet(x, y) ? 1 : 0);
        }
    }
    
    return 0;
}