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)

fn main() {
    let mut buf = String::new();
    let _ = std::io::stdin().read_line(&mut buf).ok();
    let mut buf = buf.split_whitespace();
    let n: usize = buf.next().unwrap().parse().unwrap();
    let m: usize = buf.next().unwrap().parse().unwrap();
    let mut g = vec![vec![];n];
    for _ in 0..m {
        let mut buf = String::new();
        let _ = std::io::stdin().read_line(&mut buf).ok();
        let mut buf = buf.split_whitespace();
        let j: usize = buf.next().unwrap().parse().unwrap();
        let k: usize = buf.next().unwrap().parse().unwrap();
        g[k].push(j);
        g[j].push(k);
    }
    let mut colors = vec![-1;n];
    let mut color = 0;
    for i in 0..n {
        let mut s = Vec::new();
        if colors[i] == -1 {
            s.push(i);
            while s.len() != 0 {
                let p = s.pop().unwrap();
                colors[p] = color;
                for j in &g[p] {
                    if colors[*j] == -1 {
                        s.push(*j);
                    }
                }
            }
        color += 1;
        }
    }
    //println!("{:?}",colors);
    let mut buf = String::new();
    let _ = std::io::stdin().read_line(&mut buf).ok();
    let n: usize = buf.trim().parse().unwrap();
    for _ in 0..n {
        let mut buf = String::new();
        let _ = std::io::stdin().read_line(&mut buf).ok();
        let mut buf = buf.split_whitespace();
        let j: usize = buf.next().unwrap().parse().unwrap();
        let k: usize = buf.next().unwrap().parse().unwrap();
        if colors[j] == colors[k] {
            println!("yes");
        } else {
            println!("no");
        }
    }
}
//fn main() {
//    let mut buf = String::new();
//    let _ = std::io::stdin().read_line(&mut buf).ok();
//    let mut buf = buf.split_whitespace();
//    let n: usize = buf.next().unwrap().parse().unwrap();
//    let m: usize = buf.next().unwrap().parse().unwrap();
//    let mut c = Vec::new();
//    for i in 0..n {
//        c.push(i);
//    }
//    for _ in 0..m {
//        let mut buf = String::new();
//        let _ = std::io::stdin().read_line(&mut buf).ok();
//        let mut buf = buf.split_whitespace();
//        let j: usize = buf.next().unwrap().parse().unwrap();
//        let k: usize = buf.next().unwrap().parse().unwrap();
//        let a = c[k];
//        for i in 0..n {
//            if c[i] == a {
//                c[i] = c[j];
//            }
//        }
//    }
//    let mut buf = String::new();
//    let _ = std::io::stdin().read_line(&mut buf).ok();
//    let n: usize = buf.trim().parse().unwrap();
//    for _ in 0..n {
//        let mut buf = String::new();
//        let _ = std::io::stdin().read_line(&mut buf).ok();
//        let mut buf = buf.split_whitespace();
//        let j: usize = buf.next().unwrap().parse().unwrap();
//        let k: usize = buf.next().unwrap().parse().unwrap();
//        if c[j] == c[k] {
//            println!("yes");
//        } else {
//            println!("no");
//        }
//    }
//}