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.ArrayList;
import java.util.LinkedList;
import java.util.Scanner;


public class Main{

	@SuppressWarnings("unchecked")
	public static void main(String[] args) {
		Scanner s = new Scanner(System.in);
		String[] a = s.nextLine().split(" ");
		int friendCnt = Integer.parseInt(a[0]);
		int connectCnt = Integer.parseInt(a[1]);
		ArrayList<Integer>[] input = new ArrayList[friendCnt];
		for(int xx = 0 ; xx<friendCnt ; xx++) {
			input[xx] = new ArrayList<Integer>();
		}
		for(int i=0 ; i<connectCnt ; i++) {
			String[] b = s.nextLine().split(" ");
			int formmer = Integer.parseInt(b[0]);
			int latter = Integer.parseInt(b[1]);
			input[formmer].add(latter);
			input[latter].add(formmer);
		}
		int cnt = Integer.parseInt(s.nextLine());
		boolean[] already = new boolean[friendCnt];
		for(int yy=0 ; yy<already.length ; yy++) {
			already[yy] = false;
		}
		boolean flg = false;
		for(int i=0 ; i<cnt ; i++) {
			flg = false;
			String[] c = s.nextLine().split(" ");
			int start = Integer.parseInt(c[0]);
			int end = Integer.parseInt(c[1]);
			LinkedList<Integer> queue = new LinkedList<Integer>();

			queue.offer(start);
			inner :while(! queue.isEmpty()) {
				int current = (Integer)queue.poll();
				if(already[current])
					continue;
				already[current] = true;
				if(current==end) {
					System.out.println("yes");
					flg = true;
					break inner;
				}
				for(int j=0 ; j<input[current].size() ; j++) {
					int next = (Integer)input[current].get(j);
					queue.offer(next);
				}
			}
			if(!flg)
				System.out.println("no");
		}
	}

}