1118 Birds in Forest (25分) 简单并查集

Some scientists took pictures of thousands of birds in a forest. Assume that all the birds appear in the same picture belong to the same tree. You are supposed to help the scientists to count the maximum number of trees in the forest, and for any pair of birds, tell if they are on the same tree.

Input Specification:

Each input file contains one test case. For each case, the first line contains a positive number N (≤10​4​​) which is the number of pictures. Then N lines follow, each describes a picture in the format:

K B​1​​ B​2​​ ... B​K​​

where K is the number of birds in this picture, and B​i​​'s are the indices of birds. It is guaranteed that the birds in all the pictures are numbered continuously from 1 to some number that is no more than 10​4​​.

After the pictures there is a positive number Q (≤10​4​​) which is the number of queries. Then Q lines follow, each contains the indices of two birds.

Output Specification:

For each test case, first output in a line the maximum possible number of trees and the number of birds. Then for each query, print in a line Yes if the two birds belong to the same tree, or No if not.

Sample Input:

4
3 10 1 2
2 3 4
4 1 5 7 8
3 9 6 4
2
10 5
3 7

Sample Output:

2 10
Yes
No

 大意：n张图，每张图片里k只鸟都是一棵树上的。问共有几棵树，几只鸟？

 一刷：柳

#include <iostream>
#include <vector>

using namespace std;

constexpr auto maxn = 10001;
vector<int> father(maxn),cnt(maxn,0);

int find(int x)
{
	/*if (x=father[x])//含路径压缩的find
	{
		return x;
	}
	return father[x] = find(father[x]);*/

	//第二种方式的find   好好弄懂两者的区别，第二种find是对的在本题中，区别只在于这find函数中
	int a = x;
	while (x != father[x])
		x = father[x];
	while (a != father[a]) {
		int z = a;
		a = father[a];
		father[z] = x;
	}
	return x;
}

void merge(int a, int b)
{
	int fA = find(a), fB = find(b);
	if (fA!=fB)
	{
		father[fB] = fA;
	}
}

int main()
{
	//freopen("in.txt", "r", stdin);
	int n,k,trees=0,birds=0;
	cin >> n;
	vector<bool> exist(maxn);
	
	for (int i = 0; i < maxn; i++)
	{
		father[i] = i;
	}
	for (int i = 0; i < n; i++)
	{
		cin >> k;
		int temp;
		cin >> temp;
		exist[temp] = true;
		for (int j = 1; j < k; j++)
		{
			int id;
			cin >> id;
			exist[id] = true;
			merge(id, temp);
			temp = id;
		}
	}
	//处理数据，得到树和鸟的数量
	for (int i = 0; i < maxn; i++)
	{
		if (exist[i])
		{
			int root = find(i);
			cnt[root]++;
		}
	}
	for (int i = 0; i < maxn; i++)
	{
		if (exist[i]&&cnt[i]!=0)
		{
			trees++;
			birds += cnt[i];
		}
	}
	cout << trees << " " << birds << endl;
	int q;
	cin >> q;
	for (int i = 0; i < q; i++)
	{
		int a, b;
		cin >> a >> b;
		if (find(a)==find(b))
		{
			cout << "Yes";
		}
		else
		{
			cout << "No";
		}
		cout << endl;
	}
	return 0;
}

 二刷：吾：

#include <iostream>
#include <vector>

using namespace std;

const int maxn = 10006;
vector<int> father(maxn),isroot(maxn,0);

int findfather(int x)
{
	return x == father[x] ? x : father[x] = findfather(father[x]);
}

void Union(int a, int b)
{
	int fa = findfather(a), fb = findfather(b);
	if (fa!=fb)
	{
		father[fa] = fb;
	}
}

int main()
{
	//freopen("in.txt", "r", stdin);
	int n, k;
	cin >> n;
	bool visit[maxn] = { false };
	for (int i = 0; i < maxn; i++)
	{
		father[i] = i;
	}
	for (int t = 0; t < n; t++)
	{
		cin >> k;
		int bird;
		cin >> bird;
		visit[bird] = true;
		for (int i = 1; i < k; i++)
		{
			int temp;
			cin >> temp;
			visit[temp] = true;
			Union(bird, temp);
		}
	}
	
	for (int i = 0; i < maxn; i++)
	{
		if (visit[i])
		{
			int root = findfather(i);
			isroot[root]++;
		}
	}
	int treecnt = 0,birdscnt=0;
	for (auto c : isroot)
	{
		if (c!=0)
		{
			treecnt++;
			birdscnt += c;
		}
	}
	cout << treecnt << " " << birdscnt << endl;
	int q;
	cin >> q;
	for (int i = 0; i < q; i++)
	{
		int a, b;
		cin >> a >> b;
		printf("%s\n", (findfather(a) == findfather(b)) ? "Yes" : "No");
	}
	return 0;
}