VIJOS P1034 亲戚

最新推荐文章于 2022-05-21 16:51:51 发布

qhpeklh5959

最新推荐文章于 2022-05-21 16:51:51 发布

阅读量470

点赞数

分类专栏：数据结构

本文链接：https://blog.csdn.net/severus_qin/article/details/8462558

版权

数据结构专栏收录该内容

41 篇文章 0 订阅

订阅专栏

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <algorithm>
using namespace std;
#define N 5010
int p[N];
int find(int x)
{
	return p[x] != x ? p[x] = find(p[x]) : x;
}
int main()
{
	int n, m, q;
	int x, y, r1, r2;
	scanf("%d%d%d", &n, &m, &q);
	for (int i = 1; i <= n; i++) p[i] = i;
	for (int i = 1; i <= m; i++)
	{
		scanf("%d%d", &x, &y);
		r1 = find(x); r2 = find(y);
		if (r1 != r2) p[r2] = r1;
	}
	for (int i = 1; i <= q; i++)
	{
		scanf("%d%d", &x, &y);
		r1 = find(x); r2 = find(y);
		if (r1 == r2) printf("Yes\n");
		else printf("No\n");
	}
	return 0;
}

题目链接： https://vijos.org/problems/P1034

并查集入门题