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>
#include <stdlib.h>

#define HEAD 10000

int *p, *upstep;

void unite(int, int);
int same(int, int);
void makeSet(int);
void link(int, int);
int findSet(int);

int main(){
  int i, x, y, n, q;
  int *a;
  int com;

  scanf("%d %d", &n, &q);

  p = (int *)malloc(n*sizeof(int));
  upstep = (int *)malloc(n*sizeof(int));

  a = (int *)malloc(q * sizeof(int));

  for(i  = 0;i < q;i ++)
    {
      a[i] = HEAD;
    }

  for(i = 0;i < n;i ++)
    {
      makeSet(i);
    }

  for(i = 0;i < q;i ++)
    {
      scanf("%d %d %d", &com, &x, &y);
      if(com == 0)
	{
	  unite(x, y);
        }else if(com == 1)
	{
	  a[i] = same(x, y);
	}
    }

  for(i = 0;i < q;i ++)
    {
      if(a[i] != HEAD){
	printf("%d\n", a[i]);
      }
    }
  return 0;
}
   
void makeSet(int x)
{
  p[x] = x;
  upstep[x]=0;
}
    
void unite(int x, int y)
{
  link(findSet(x),findSet(y));
}
    
void link(int x, int y)
{
  if(upstep[x] > upstep[y])
    {
      p[y] = x;
    }
  else{
    p[x] = y;

    if(upstep[x] == upstep[y])
      {
	upstep[y] = upstep[x];
      }
  }
}
    
int findSet(int x)
{
  if(x!=p[x]) p[x] = findSet(p[x]);
  return p[x];
}
    
int same(int x, int y)
{
  if(findSet(x) == findSet(y)) return 1;
  else return 0;
}