Problem:
MathJax.Hub.Config({ tex2jax: { inlineMath: [["$","$"], ["\\(","\\)"]], processEscapes: true }});

Connected Components

Write a program which reads relations in a SNS (Social Network Service), and judges that given pairs of users are reachable each other through the network.

Input

In the first line, two integer $n$ and $m$ are given. $n$ is the number of users in the SNS and $m$ is the number of relations in the SNS. The users in the SNS are identified by IDs $0, 1, ..., n-1$.

In the following $m$ lines, the relations are given. Each relation is given by two integers $s$ and $t$ that represents $s$ and $t$ are friends (and reachable each other).

In the next line, the number of queries $q$ is given. In the following $q$ lines, $q$ queries are given respectively. Each query consists of two integers $s$ and $t$ separated by a space character.

Output

For each query, print "yes" if $t$ is reachable from $s$ through the social network, "no" otherwise.

Constraints

$2 \leq n \leq 100,000$

$0 \leq m \leq 100,000$

$1 \leq q \leq 10,000$

Sample Input

10 9
0 1
0 2
3 4
5 7
5 6
6 7
6 8
7 8
8 9
3
0 1
5 9
1 3

Sample Output

yes
yes
no

Solution in Rust (judge verdict: Accepted)

use std::io;
use std::io::BufRead;

struct Graph {
    n: usize,
    adj: Vec<Vec<usize>>,
}

fn read_graph() -> Graph {
    let stdin = io::stdin();
    let lock = stdin.lock();
    let mut lines = lock.lines();

    let nm: Vec<_> = lines
        .next()
        .unwrap()
        .unwrap()
        .split_whitespace()
        .map(|s| s.parse().unwrap())
        .collect();
    let n = nm[0];
    let m = nm[1];
    let mut adj = vec![vec![]; n];

    for _ in 0..m {
        let parsed: Vec<usize> = lines
            .next()
            .unwrap()
            .unwrap()
            .split_whitespace()
            .map(|s| s.parse().unwrap())
            .collect();
        let i = parsed[0];
        let j = parsed[1];

        adj[i].push(j);
        adj[j].push(i);
    }

    Graph { n, adj }
}

fn dfs(g: &Graph, d: &mut Vec<Option<usize>>, i: usize, root: usize) {
    d[i] = Some(root);
    for &next_i in g.adj[i].iter() {
        if d[next_i] == None {
            dfs(g, d, next_i, root);
        }
    }
}

fn main() {
    let graph = read_graph();

    let mut d = vec![None; graph.n];

    for i in 0..(graph.n) {
        if d[i] == None {
            dfs(&graph, &mut d, i, i);
        }
    }

    let stdin = io::stdin();
    let lock = stdin.lock();
    let mut lines = lock.lines();
    let q = lines.next().unwrap().unwrap().parse().unwrap();

    for _ in 0..q {
        let parsed: Vec<usize> = lines
            .next()
            .unwrap()
            .unwrap()
            .split_whitespace()
            .map(|s| s.parse().unwrap())
            .collect();
        let i = parsed[0];
        let j = parsed[1];

        println!("{}", if d[i] == d[j] { "yes" } else { "no" });
    }
}