PAT甲级1118 Birds in Forest (25 分)

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张照片，随后n行即是每张照片上的鸟的数量以及代号，输出森林的数的总数，以及鸟的总数。注意鸟的编号是不唯一的，且每一张照片上的鸟是属于那棵树的，随后给出q次查询，给出一对鸟的编号，问是否在同一棵树上。

思路：

         用并查集解决，没一次读取一张照片，就让相应的鸟的编号Union，对于鸟的总数的统计，用一个集合来表示，每次都录入exist中，exist的size就是鸟的总数。录入所有信息后，如果找到指向自己的就是一颗树，统计个数。

参考代码：

 

 

#include<cstdio>
#include<vector>
#include<set>
using namespace std;
set<int> exist;
int father[100000];
int findfather(int x){
	if(x == father[x]) return x;
	int f = findfather(father[x]);
	father[x] = f;
	return f;
}
void Union(int a, int b){
	int fa = findfather(a), fb = findfather(b);
	if(fa != fb) father[fa] = fb;
}
int n, k, nt, q;
int main(){
	scanf("%d", &n);
	for(int i = 0; i < 100000; ++i)	father[i] = i;
	for(int i = 0; i < n; ++i){
		scanf("%d", &k);
		for(int j = 0; j < k; ++j){
			int a, last;
			scanf("%d", &a);
			exist.insert(a);
			if(j != 0)	Union(a, last);
			last = a;
		}
	}
	for(auto it = exist.begin(); it != exist.end(); ++it)
		if(father[*it] == *it) nt++;
	scanf("%d", &q);
	printf("%d %d\n", nt, exist.size());
	for(int i = 0; i < q; ++i){
		int a, b;
		scanf("%d %d", &a, &b);
		if(findfather(a) == findfather(b)) printf("Yes\n");
		else printf("No\n");
	}
	return 0;
}