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 JAVA (judge verdict: Wrong Answer)

import java.io.*;
import java.util.*;
import java.util.stream.Collectors;

class Pair{
    private int file;
    private int time;
}

class Main{
    Map<Integer, List<Integer>> map = new HashMap<>();
    public void run(){
        try(BufferedReader br = new BufferedReader(new InputStreamReader(System.in))){
            int line = Integer.parseInt(br.readLine().split(" ")[1]);
            for(int i = 0; i < line; i++){
                String[] inputString = br.readLine().split(" ");
                if(map.containsKey(Integer.parseInt(inputString[0])))
                    map.get(Integer.parseInt(inputString[0])).add(Integer.parseInt(inputString[1]));
                else{
                    map.put(Integer.parseInt(inputString[0]), new ArrayList<Integer>());
                    map.get(Integer.parseInt(inputString[0])).add(Integer.parseInt(inputString[1]));
                }
            }
            br.readLine();
            br.lines()
                .filter(n -> !Objects.equals("", n))
                .map(n -> n.split(" "))
                .forEach(n -> yesOrNo(checker(Integer.parseInt(n[0]), Integer.parseInt(n[1]))));
        }catch(Exception e){
            System.out.println(e);
        }
    }
    public boolean checker(int key, int target){


        if(!map.containsKey(key))
            return false;
        if(map.get(key).contains(target)){
            return true;
        }
        else{
            for(int a : map.get(key))
                if(checker(a, target))
                    return true;
        }
        return false;
    }

    public void yesOrNo(boolean b){
        if(b)
            System.out.println("yes");
        else
            System.out.println("no");
    }
    public static void main(String[] args){
        new Main().run();
    }
}