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: Accepted)

import java.io.*;
import java.util.*;

public class Main {
	
	static List<List<Integer>> list;
	static int status[];
	
	public static void main(String[] args) {
		Scanner in=new Scanner(System.in);
		int n=in.nextInt(), m=in.nextInt();list=new ArrayList<List<Integer>>();
		for(int i=0;i<n;i++) {
			List<Integer> l=new ArrayList<>();
			list.add(l);
		}
		
		for(int i=0;i<m;i++) {
			int s=Integer.parseInt(in.next()), t=Integer.parseInt(in.next());
			list.get(s).add(t);
			list.get(t).add(s);
		}
		
		status=new int[n];
		int color=1;
		for(int i=0;i<n;i++) {
			if(status[i]==0) {
				solve(n,i,color);
				color++;
			}
		}
		int q=in.nextInt();
		
		PrintWriter out=new PrintWriter(System.out);
		for(int i=0;i<q;i++) {
			int s=Integer.parseInt(in.next()), t=Integer.parseInt(in.next());
			if(status[s]==status[t])out.println("yes");
			else out.println("no");
		}
		out.flush();
	}
	
	static void solve(int n,int s,int c) {
		Queue<Integer> q=new ArrayDeque<>();
		q.add(s);
		status[s]=c;
		
		while(!q.isEmpty()) {
			int u=q.remove();
			for(int i=0;i<list.get(u).size();i++) {
				int next=list.get(u).get(i);
				if(status[next]==0) {
					status[next]=c;
					q.add(next);
				}
			}
		}
	}
}