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>
#define MAX 10000

typedef struct node{
 int id;
 int rootid;
 struct node *up;
}node;



int Getrootid(node N[],int x){
 node *p;

 if(N[x].up==NULL)N[x].rootid=x;

 else{
  p=N[x].up;
  while(p->up != NULL)p=p->up;
  N[x].rootid=p->id;
  N[x].up=p;
 }


return N[x].rootid;
}



int main(){

 int n,q,i;
 int com;
 int x,y;
 node N[MAX];


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

 for(i=0;i<n;i++){
  N[i].id=i;
  N[i].rootid=-1;
  N[i].up=NULL;
 }

 for(i=0;i<q;i++){

   scanf("%d",&com);

   if(com==0){/*unite*/

    scanf("%d %d",&x,&y);
    N[x].rootid=Getrootid(N,x);
    N[y].rootid=Getrootid(N,y);
    if(N[x].rootid != N[y].rootid)
     N[ N[x].rootid ].up=&(N[ N[y].rootid ]);

   }
   else if(com==1){/*same*/

    scanf("%d %d",&x,&y);
    N[x].rootid=Getrootid(N,x);
    N[y].rootid=Getrootid(N,y);
    if(N[x].rootid==N[y].rootid)
     printf("1\n");
    else printf("0\n");

   }

 }

return 0;
}