PAT A1118 Birds in Forest (25point(s))

Scroll Down

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 (≤$104$) which is the number of pictures. Then N lines follow, each describes a picture in the format:K B1B2 ... BK where K is the number of birds in this picture, and Bi'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 $104$.
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

解答

#define _CRT_SECURE_NO_WARNINGS
#include<iostream>
#include<algorithm>
#include<unordered_map>
#include<unordered_set>
#include<cstring>

using namespace std;

unordered_map<int, int> parent;
int rank1[10000];

int Find(int a) {
	if (parent.find(a) == parent.end()) return parent[a] = a;
	if (parent[a] != a) return parent[a] = Find(parent[a]);
	return a;
}
void Union(int a, int b) {
	int pa = Find(a);
	int pb = Find(b);
	if (rank1[pa] > rank1[pb]) parent[pb] = pa;
	else {
		parent[pa] = pb;
		if (rank1[pa] == rank1[pb] && pa != pb) rank1[pb]++;
	}
}
int main()
{
	int n, num, tmp;
	memset(rank1, 0, sizeof(rank1));
	scanf("%d", &n);
	for (int i = 0; i < n; i++) {
		int nn;
		scanf("%d", &nn);
		scanf("%d", &num);
		if (parent.find(num) == parent.end()) parent[num] = num; // 坑点
		for (int j = 1; j < nn; j++) {
			scanf("%d", &tmp);
			Union(num, tmp);
		}
	}
	unordered_set<int> parents;
	for (auto it = parent.begin(); it != parent.end(); it++) 
		parents.insert(Find(it->first));
	printf("%d %d\n", parents.size(), parent.size());
	scanf("%d", &n);
	for (int i = 0; i < n; i++) {
		scanf("%d %d", &num, &tmp);
		if (Find(num) != Find(tmp)) printf("No\n");
		else printf("Yes\n");
	}
	return 0;
}