Biaocheng_Combined Check Set

Biaocheng_Combined Check Set

#include<iostream>
#include<cstdio>
using namespace std;
int n,m,p,f[50010];
void makenull()//初始化 
{
    
    
	for(int i=1;i<=n;f[i]=i,i++);
	return;
}
int find(int x)//找代表值 
{
    
    
	if(x==f[x])return x;
	return f[x]=find(f[x]);
}
void merge(int x,int y)//合并
{
    
    
	f[find(y)]=find(x);
	return;
}
bool connect(int x,int y)//判断同连通块 
{
    
    
	return (find(x)==find(y));
}
int main()
{
    
    
	int i,x,y;
	scanf("%d%d%d",&n,&m,&p);
	makenull();
	for(i=1;i<=m;i++)//合并 
	{
    
    
		scanf("%d%d",&x,&y);
		merge(x,y);
	}
	for(i=1;i<=p;i++)
	{
    
    
		scanf("%d%d",&x,&y);
		if(connect(x,y)) printf("Yes\n");
		else printf("No\n");
	}
	return 0;
}