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 Rust (1.42.0) (judge verdict: Accepted)

#![allow(unused)]
use proconio::*;

// /////////////////////
// Disjoint Set Union //
// /////////////////////

struct DSU {
    len: usize,
    parent: Vec<usize>,
    rank: Vec<usize>,
}

impl DSU {
    fn new(len: usize) -> Self {
        let mut parent = Vec::with_capacity(len);
        for i in 0..len {
            parent.push(i);
        }
        Self {
            len,
            parent,
            rank: vec![1; len],
        }
    }
    fn find_parent(&mut self, u: usize) -> usize {
        assert!(u < self.len);

        let x = self.parent[u];

        if x == u {
            x
        } else {
            let parent = self.find_parent(x);
            self.parent[u] = parent;
            parent
        }
    }
    fn merge(&mut self, u: usize, v: usize) -> usize {
        assert!(u < self.len);
        assert!(v < self.len);
        let x = self.find_parent(u);
        let y = self.find_parent(v);

        if x == y {
            x
        } else {
            if self.rank[x] > self.rank[y] {
                self.rank[x] += self.rank[y];
                self.parent[y] = x;
                self.rank[y] = 0;
                x
            } else {
                self.rank[y] += self.rank[x];
                self.parent[x] = y;
                self.rank[x] = 0;
                y
            }
        }
    }
}

fn main() {
    input! {
    n: usize,
        q: usize,
        a: [(usize,usize,usize);q],
    }

    let mut dsu = DSU::new(n);
    for &(t, u, v) in &a {
        if t == 0 {
            dsu.merge(u, v);
        } else {
            if dsu.find_parent(u) == dsu.find_parent(v) {
                println!("{}", 1);
            } else {
                println!("{}", 0);
            }
        }
    }
}