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 Ruby (2.7.1) (judge verdict: Accepted)

n, q = gets.split.map &:to_i

@root = Array.new(n + 1) {|i| i}
def find(x); @root[x] = @root[x] == x ? x : find(@root[x]); end
def union(x,y); (x = find(x)) == (y = find(y)) or @root[x] = y ; end

q.times do
    t, u, v = gets.split.map &:to_i
    if t == 0
        union u, v
    else
        a = find u
        b = find v

        puts a == b ? 1 : 0
    end
end