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)

#include<stdio.h>
#include<stdlib.h>

#define TRUE 1
#define FALSE 0

typedef struct nl{
	int node;
	struct nl *next;
}nodeList;

nodeList *header[100000];
int isVisited[100000]={0};
void initList(nodeList *header[],int nodeNum){
	int i;
	for(i=0;i<nodeNum;i++){
		header[i]=NULL;
	}
}

void clearArray(int list[],int n){
	int i;
	for(i=0;i<n;i++){
		list[i]=0;
	}
}

void addList(int src,int dest){
	nodeList *p;
	nodeList *data;
	data=(nodeList*)malloc(sizeof(nodeList));
	data->node=dest;
	data->next=0;
	if(header[src]!=NULL){
		for(p=header[src];p->next!=NULL;p=p->next);
		p->next=data;
	}else{
		header[src]=data;
	}
}

int dfs(int src,int dest,int nodeNum){
	if(src==dest)return 1;
	isVisited[src]=1;
	nodeList *p;
	for(p=header[src];p!=NULL;p=p->next){
		if(isVisited[p->node]==0){
			if(dfs(p->node,dest,nodeNum)==1){
				return 1;
			}
		}
	}
	return 0;
}

void freeList(nodeList *header[],int n){
	nodeList *p,*next;
	int i;
	for(i=0;i<n;i++){
		p=header[i];
		next=p->next;
		while(p!=NULL){
			free(p);
			p=next;
			next=p->next;
		}
	}
}
			
		
	

int main(void){
	int n,m;
	int i,j;
	int a,b;
	scanf("%d %d",&n,&m);
	initList(header,n);
	for(i=0;i<m;i++){
		scanf("%d %d",&a,&b);
		addList(a,b);
		addList(b,a);
	}
	int q;
	scanf("%d",&q);
	for(i=0;i<q;i++){
		scanf("%d %d",&a,&b);
		clearArray(isVisited,n);
		if(dfs(a,b,n)==1){
			printf("yes\n");
		}else{
			printf("no\n");
		}
	}
	//freeList(header,n);
	return 0;
}