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)

#include <stdio.h>

int main(void)
{
    int n, q;
    int i, j;
    int com[100000], x[100000], y[100000];
    int group[100000];
    int tmp;

    scanf("%d %d", &n, &q);
    for (i = 0; i < q; i++)
    {
        scanf("%d %d %d", &com[i], &x[i], &y[i]);
    }
    for (i = 0; i < n; i++)
    {
        group[i] = i;
    }

    for (i = 0; i < q; i++)
    {
        if (com[i] == 0) //unite
        {
            tmp = group[y[i]];
            for (j = 0; j < n; j++)
            {
                if (group[j] == tmp)
                {
                    group[j] = group[x[i]];
                }
            }
        }
        if (group[x[i]] == group[y[i]] && com[i] == 1)
        {
            printf("1\n");
        }
        else if (com[i] == 1)
        {
            printf("0\n");
        }
    }
    return 0;
}