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)

#![doc = " # Bundled libraries"]
#![doc = ""]
#![doc = " ## `kyopro_lib` (private)"]
#![doc = ""]
#![doc = " ### Modules"]
#![doc = ""]
#![doc = " - `::__kyopro_lib::unionfind` → `$crate::unionfind`"]
#[allow(unused_imports)]
use itertools::Itertools;
use proconio::input;
#[allow(unused_imports)]
use proconio::marker::*;
fn main() {
    input! { n : usize , q : usize , tuv : [(i32 , usize , usize) ; q] , }
    let mut uf = unionfind::UnionFind::new(n);
    for (t, u, v) in tuv {
        if t == 0 {
            uf.unite(u, v);
        } else {
            println!("{}", if uf.is_same(u, v) { 1 } else { 0 });
        }
    }
}
pub mod unionfind {
    #[derive(Clone)]
    enum Node {
        Root(usize),
        Leaf(usize),
    }
    pub struct UnionFind {
        node: Vec<Node>,
    }
    impl UnionFind {
        pub fn new(n: usize) -> Self {
            Self {
                node: vec![Node::Root(1); n],
            }
        }
        pub fn root(&mut self, i: usize) -> usize {
            if let Node::Leaf(p) = self.node[i] {
                let r = self.root(p);
                self.node[i] = Node::Leaf(r);
                r
            } else {
                i
            }
        }
        pub fn unite(&mut self, u: usize, v: usize) -> bool {
            let mut u = self.root(u);
            let mut v = self.root(v);
            if u == v {
                return false;
            }
            if let (Node::Root(us), Node::Root(vs)) = (&self.node[u], &self.node[v]) {
                if us < vs {
                    std::mem::swap(&mut u, &mut v);
                }
                self.node[u] = Node::Root(us + vs);
                self.node[v] = Node::Leaf(u);
            }
            true
        }
        pub fn size(&mut self, i: usize) -> usize {
            let r = self.root(i);
            if let Node::Root(s) = self.node[r] {
                s
            } else {
                0
            }
        }
        pub fn is_same(&mut self, i: usize, j: usize) -> bool {
            self.root(i) == self.root(j)
        }
    }
}