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.File;
import java.io.IOException;
import java.util.Scanner;

public class Main {
	static int time = 0;

	public static void main(String[] args) throws IOException {

		Scanner scan = new Scanner(System.in);
		// Scanner scan = new Scanner(new
		// File("D:\\UserArea\\J0124567\\Downloads\\ALDS1_6_A-in9.txt"));

		int n = scan.nextInt();
		int m = scan.nextInt();

		boolean[][] sns = new boolean[n][n];
		for (int i = 0; i < n; i++)
			sns[i][i] = true;

		for (int i = 0; i < m; i++) {
			int s = scan.nextInt();
			int t = scan.nextInt();
			sns[s][t] = true;
			sns[t][s] = true;
		}

		while (MatM(sns))
			;

		int q = scan.nextInt();
		for (int i = 0; i < q; i++) {
			int s = scan.nextInt();
			int t = scan.nextInt();
			if (sns[s][t])
				System.out.println("yes");
			else
				System.out.println("no");
		}

		scan.close();
		System.exit(0);
	}

	private static boolean MatM(boolean[][] sns) {
		int n = sns.length;
		boolean[][] r = new boolean[n][n];

		for (int x = 0; x < n; x++)
			for (int y = 0; y < n; y++)
				for (int i = 0; i < n; i++)
					if (sns[x][i] && sns[i][y]) {
						r[x][y] = true;
						break;
					}
		boolean chg = false;
		for (int x = 0; x < n; x++)
			for (int y = 0; y < n; y++) {
				if (sns[x][y] ^ r[x][y])
					chg = true;
				sns[x][y] = r[x][y];
			}

		return chg;
	}

}