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.util.*;
 class ID{
    public int id;
    public ID(int id){
        this.id = id;
    }
}
public class Main {

    public static void main(String[] args) {
        
        Scanner scanner = new Scanner(System.in);
        ID nullID = new ID(-1);
        ID[] group = new ID[scanner.nextInt()];
        for(int i=0; i<group.length;i++)
            group[i] = nullID;

        int m = scanner.nextInt();
        ArrayList<ID> idList = new ArrayList<ID>();
        int groupID = 0;
        for (int i = 0; i < m; i++) {
            int s = scanner.nextInt();
            int t = scanner.nextInt();
            if(group[s].id==-1 && group[t].id==-1){
                idList.add(new ID(groupID));
                group[s]=group[t]= idList.get(groupID++);
            }else if(group[s].id!=-1 && group[t].id==-1)
                group[t]=group[s];
            else if(group[s].id==-1 && group[t].id!=-1)
                group[s]=group[t];
            else{
                idList.get(group[s].id).id = group[t].id;
            }
        }
        // for(int k=0; k<group.length ;k++)
        //     System.out.print(group[k]+" ");
        // System.out.println("");
        int q = scanner.nextInt();
        for (int i = 0; i < q; i++){
            int s = scanner.nextInt();
            int t = scanner.nextInt();
            if (group[s].id == group[t].id && group[s].id!=-1)
                System.out.println("yes");
            else
                System.out.println("no");
        }
    }
 

}