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: Time Limit Exceeded)

import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.Arrays;

public class Main {

	// connected components
	// cc[-1] : not searched
	// cc[s] = cc[t] : same component
	static int[] cc;

	public static void main(String[] args) throws Exception {
		// TODO ?????????????????????????????????????????????
		BufferedReader br =
				new BufferedReader(new InputStreamReader(System.in));

		String[] data = br.readLine().split(" ");
		int n = Integer.parseInt(data[0]);
		int m = Integer.parseInt(data[1]);

		cc = new int[n];
		Arrays.fill(cc, -1);

		for (int i=0; i < m; i++) {
			data = br.readLine().split(" ");
			int s = Integer.parseInt(data[0]);
			int t = Integer.parseInt(data[1]);

			if (cc[s] == -1) {
				if (cc[t] == -1) { // cc[s] =-1 & cc[t] = -1
					cc[s] = cc[t] = i;
				} else { // cc[s] = -1 & cc[t] != -1
					cc[s] = cc[t];
				}
			} else { // cc[s] != -1
				if (cc[t] == -1) { // cc[s] != -1 & cc[t] == -1
					cc[t] = cc[s];
				} else { // cc[s] != -1 & cc[t] != -1
					int temps = cc[s];
					int tempt = cc[t];

					for (int j=0; j < n; j++) {
						if (cc[j]==temps || cc[j]==tempt) {
							cc[j] = i;
						}
					}
				}
			}
		}
//		System.out.println(Arrays.toString(cc));
		StringBuilder ans = new StringBuilder();

		int q = Integer.parseInt(br.readLine());
		for (int i=0; i < q; i++) {
			data = br.readLine().split(" ");
			int s = Integer.parseInt(data[0]);
			int t = Integer.parseInt(data[1]);

			// cc[s] != cc[t] => no
			// cc[s] = cc[t] = -1 => no
			if (cc[s] == cc[t] && cc[s] != -1) ans.append("yes\n");
			else ans.append("no\n");
		}

		System.out.print(ans);
	}

}