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 C# (judge verdict: Time Limit Exceeded)

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;

namespace Graph_I
{
    class Connected_Components
    {

        static void Main(string[] args)
        {
            var nm = Console.ReadLine().Split(' ').Select(s => int.Parse(s)).ToArray();
            var n = nm[0];
            var m = nm[1];
            var G = new bool[n, n];

            for (int i = 0; i < m; i++)
            {
                var st = Console.ReadLine().Split(' ').Select(a => int.Parse(a)).ToArray();
                var s = st[0];
                var t = st[1];
                G[s, t] = G[t, s] = true;
            }

            var q = int.Parse(Console.ReadLine());

            var str = new StringBuilder();
            for (int i = 0; i < q; i++)
            {
                var st = Console.ReadLine().Split(' ').Select(a => int.Parse(a)).ToArray();
                if (BreadthFirstSearch(G, st[0], st[1]) != -1) str.Append("yes\n");
                else str.Append("no\n");
            }

            Console.Write(str.ToString());
        }

        static int BreadthFirstSearch(bool[,] graph, int departure, int destination)
        {
            var n = graph.GetLength(0);
            var done = new bool[n];
            var dist = new int[n];
            var queue = new Queue<int>();

            done[departure] = true;
            dist[departure] = 0;
            queue.Enqueue(departure);

            while (queue.Count > 0)
            {
                var r = queue.Dequeue();
                if (r == destination) return dist[r];
                for (int i = 0; i < n; i++)
                {
                    if (graph[r, i] && !done[i])
                    {
                        done[i] = true;
                        dist[i] = dist[r] + 1;
                        queue.Enqueue(i);
                    }
                }
            }
            return -1;
        }
    }
}