Problem:
Score : 100 points

Problem Statement

You are given an undirected graph with N vertices and 0 edges. Process Q queries of the following types.

0 u v: Add an edge (u, v).

1 u v: Print 1 if u and v are in the same connected component, 0 otherwise.

Constraints

1 \leq N \leq 200,000

1 \leq Q \leq 200,000

0 \leq u_i, v_i \lt N

Input

Input is given from Standard Input in the following format:

N Q
t_1 u_1 v_1
t_2 u_2 v_2
:
t_Q u_Q v_Q

出力

For each query of the latter type, print the answer.

Sample Input 1

4 7
1 0 1
0 0 1
0 2 3
1 0 1
1 1 2
0 0 2
1 1 3

Sample Output 1

0
1
0
1

Solution in C (GCC 9.2.1) (judge verdict: Wrong Answer)

#include<stdio.h>

int pa[200010]={0};

int root(int x)
{
	if(x==pa[x])return x;
	else return pa[x] = root(pa[x]);
}

void unite(int x,int y)
{
	int rx=root(x);
	int ry=root(y);
	if(rx==ry)return;
	else pa[rx]=ry;
}

int same(int x,int y)
{
	int rx=root(x);
	int ry=root(y);
	return (rx==ry);
}

int main()
{
	int n,q;
	int i,j;
	int x,y,z;
	
	scanf("%d %d",&n,&q);
	for(i=1;i<=n;i++)pa[i]=i;
	
	for(j=0;j<q;j++)
	{
		scanf("%d %d %d",&x,&y,&z);
		if(x==0)unite(y,z);
		else if(x==1)
        {
		    if(same(y,z))printf("1");
		    else printf("0");
        }
	}

}