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)

use atcoder_dsu::*;
use input_mcr::*;
use std::cmp::*;

fn main() {
    input! {
        n: usize,
        q: usize,
        qs: [(i32, i32, i32); q],
    }
    let mut dsu = DSU::new(n as i32);
    for &(t, u, v) in &qs {
        if t == 0 {
            dsu.merge(u, v);
        } else if t == 1 {
            let res = if dsu.same(u, v) { 1 } else { 0 };
            println!("{}", res);
        }
    }
}
pub mod input_mcr {
    // ref: tanakh <https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8>
    #[macro_export(local_inner_macros)]
    macro_rules! input {
        (source = $s:expr, $($r:tt)*) => {
            let mut parser = Parser::from_str($s);
            input_inner!{parser, $($r)*}
        };
        (parser = $parser:ident, $($r:tt)*) => {
            input_inner!{$parser, $($r)*}
        };
        (new_stdin_parser = $parser:ident, $($r:tt)*) => {
            let stdin = std::io::stdin();
            let reader = std::io::BufReader::new(stdin.lock());
            let mut $parser = Parser::new(reader);
            input_inner!{$parser, $($r)*}
        };
        ($($r:tt)*) => {
            input!{new_stdin_parser = parser, $($r)*}
        };
    }

    #[macro_export(local_inner_macros)]
    macro_rules! input_inner {
        ($parser:ident) => {};
        ($parser:ident, ) => {};
        ($parser:ident, $var:ident : $t:tt $($r:tt)*) => {
            let $var = read_value!($parser, $t);
            input_inner!{$parser $($r)*}
        };
    }

    #[macro_export(local_inner_macros)]
    macro_rules! read_value {
        ($parser:ident, ( $($t:tt),* )) => {
            ( $(read_value!($parser, $t)),* )
        };
        ($parser:ident, [ $t:tt ; $len:expr ]) => {
            (0..$len).map(|_| read_value!($parser, $t)).collect::<Vec<_>>()
        };
        ($parser:ident, chars) => {
            read_value!($parser, String).chars().collect::<Vec<char>>()
        };
        ($parser:ident, char_) => {
            read_value!($parser, String).chars().collect::<Vec<char>>()[0]
        };
        ($parser:ident, usize1) => {
            read_value!($parser, usize) - 1
        };
        ($parser:ident, line) => {
            $parser.next_line()
        };
        ($parser:ident, line_) => {
            $parser.next_line().chars().collect::<Vec<char>>()
        };
        ($parser:ident, $t:ty) => {
            $parser.next::<$t>().expect("Parse error")
        };
    }

    use std::collections::VecDeque;
    use std::io;
    use std::io::BufRead;
    use std::str;

    pub struct Parser<R> {
        pub reader: R,
        buf: VecDeque<u8>,
        parse_buf: Vec<u8>,
    }

    impl Parser<io::Empty> {
        pub fn from_str(s: &str) -> Parser<io::Empty> {
            Parser {
                reader: io::empty(),
                buf: VecDeque::from(s.as_bytes().to_vec()),
                parse_buf: vec![],
            }
        }
    }

    impl<R: BufRead> Parser<R> {
        pub fn new(reader: R) -> Parser<R> {
            Parser {
                reader: reader,
                buf: VecDeque::new(),
                parse_buf: vec![],
            }
        }
        pub fn update_buf(&mut self) {
            loop {
                let (len, complete) = {
                    let buf2 = self.reader.fill_buf().unwrap();
                    self.buf.extend(buf2.iter());
                    let len = buf2.len();
                    (len, buf2.last() < Some(&0x20))
                };
                self.reader.consume(len);
                if complete {
                    break;
                }
            }
        }
        pub fn next<T: str::FromStr>(&mut self) -> Result<T, T::Err> {
            loop {
                while let Some(c) = self.buf.pop_front() {
                    if c > 0x20 {
                        self.buf.push_front(c);
                        break;
                    }
                }
                self.parse_buf.clear();
                while let Some(c) = self.buf.pop_front() {
                    if c <= 0x20 {
                        self.buf.push_front(c);
                        break;
                    } else {
                        self.parse_buf.push(c);
                    }
                }
                if self.parse_buf.is_empty() {
                    self.update_buf();
                } else {
                    return unsafe { str::from_utf8_unchecked(&self.parse_buf) }.parse::<T>();
                }
            }
        }
        pub fn next_line(&mut self) -> String {
            loop {
                while let Some(c) = self.buf.pop_front() {
                    if c >= 0x20 {
                        self.buf.push_front(c);
                        break;
                    }
                }
                self.parse_buf.clear();
                while let Some(c) = self.buf.pop_front() {
                    if c < 0x20 {
                        self.buf.push_front(c);
                        break;
                    } else {
                        self.parse_buf.push(c);
                    }
                }
                if self.parse_buf.is_empty() {
                    self.update_buf();
                } else {
                    return unsafe { str::from_utf8_unchecked(&self.parse_buf) }.to_string();
                }
            }
        }
    }
}
pub mod atcoder_dsu {
    pub struct DSU {
        n: i32,
        parent_or_size: Vec<i32>,
    }

    impl DSU {
        pub fn new(n: i32) -> DSU {
            DSU {
                n,
                parent_or_size: vec![-1; n as usize],
            }
        }

        pub fn merge(&mut self, a: i32, b: i32) -> i32 {
            assert!(0 <= a && a < self.n);
            assert!(0 <= b && b < self.n);
            let x = self.leader(a);
            let y = self.leader(b);
            if x == y {
                return x;
            }
            let (x, y) = if -self.parent_or_size[x as usize] < -self.parent_or_size[y as usize] {
                (y, x)
            } else {
                (x, y)
            };
            self.parent_or_size[x as usize] += self.parent_or_size[y as usize];
            self.parent_or_size[y as usize] = x;
            x
        }

        pub fn same(&mut self, a: i32, b: i32) -> bool {
            assert!(0 <= a && a < self.n);
            assert!(0 <= b && b < self.n);
            self.leader(a) == self.leader(b)
        }

        pub fn leader(&mut self, a: i32) -> i32 {
            assert!(0 <= a && a < self.n);
            if self.parent_or_size[a as usize] < 0 {
                return a;
            }
            let res = self.leader(self.parent_or_size[a as usize]);
            self.parent_or_size[a as usize] = res;
            res
        }

        pub fn size(&mut self, a: i32) -> i32 {
            assert!(0 <= a && a < self.n);
            let x = self.leader(a);
            -self.parent_or_size[x as usize]
        }

        pub fn groups(&mut self) -> Vec<Vec<i32>> {
            let mut leader_buf = vec![0; self.n as usize];
            let mut group_size = vec![0; self.n as usize];
            for i in 0..self.n {
                leader_buf[i as usize] = self.leader(i);
                group_size[leader_buf[i as usize] as usize] += 1;
            }
            let mut result = vec![vec![]; self.n as usize];
            for i in 0..self.n {
                result[i as usize].reserve(group_size[i as usize] as usize);
            }
            for i in 0..self.n {
                result[leader_buf[i as usize] as usize].push(i);
            }
            result.retain(|xs| !xs.is_empty());
            result
        }
    }
}