逆天且不注意大小写
by ThroughBall @ 2023-12-10 17:04:46
lszj
by cff_0102 @ 2023-12-10 17:12:41
输出格式
pp 行，每行一个 Yes 或 No。表示第 ii 个询问的答案为“具有”或“不具有”亲戚关系。
by kmlihaiming @ 2023-12-10 17:20:25
@[ThroughBall](/user/1042069) 谢谢
by Wuski @ 2023-12-10 17:41:54
@[cff_0102](/user/542457) 什么意思？
by Wuski @ 2023-12-10 17:42:16
66666666
6
6
6666666666
6 6
6 6
666666666
by WANGXIAO_ @ 2023-12-19 17:51:38
试试我这个
```cpp
//洛谷P1551-亲戚
#include <bits/stdc++.h>
#define N 5050
using namespace std;
int n, m, p, P, M;
int fa[N];//每个点的父亲
/*
函数名：init
功能：初始化各个结点的父结点
参数：结点的总数
返回值：无
*/
void init(int x) {
for (int i = 1; i <= x; i++)
fa[i] = i;
}
/*
函数名：find
功能：查找某个结点的根结点
参数：结点的编号
返回值：根结点的编号
*/
int find(int x) {
return (fa[x] == x ? x : find(fa[x]));
}
/*
函数名：join
功能：合并两个结点所在的树
参数：点x，点y
返回值：无
*/
void join(int x, int y) {
find(x) == find(y) ? x = x, y = y : fa[find(y)] = find(x);//中间其实没用
}
int main() {
cin >> n >> M >> P;
p = P;
m = M;
init(n);
while (m--) {
int a, b;
cin >> a >> b;
join(a, b);
}
while (p--) {
int x, y;
cin >> x >> y;
cout << (find(x) == find(y) ? "Yes\n" : "No\n");
}
return 0;
}
```
by Dumbo @ 2023-12-21 18:28:10
@[Dumbo](/user/726044) 你那个容易TLE,这个可以
```c++
#include <iostream>
#define N 5050
using namespace std;
int n, m, p;
int fa[N];
int find(int x) {
if (x==fa[x]) return x;
return fa[x] = find(fa[x])
}
void join(int x, int y) {
int X = find(x), Y = find(y);
if (X!=Y) fa[X] = Y;
}
int main() {
cin >> n >> m >> p;
for (int i = 1; i <= n; i++) fa[i] = i;
while (m--) {
int a, b;
cin >> a >> b;
join(a, b);
}
while (p--) {
int x, y;
cin >> x >> y;
cout << (find(x) == find(y) ? "Yes\n" : "No\n");
}
return 0;
}
```
by Tx1234567 @ 2024-02-17 19:26:16
@[Tx1234567](/user/929192) 等于你这是优化的 bcj
by Dumbo @ 2024-02-17 21:14:52
@[Tx1234567](/user/929192) 我[又用我这个交了一遍](https://www.luogu.com.cn/record/147230808)，没 TLE 呀。
by Dumbo @ 2024-02-17 21:16:59