1118 Birds in Forest (25 分)

吐槽：这是道并查集的题，没有什么好说的，但是可以钻题目的空子还是要钻的，因为鸟的索引是连续的，所以鸟的总数就是其中最大的数，在输入的时候保存下来就行了，最后就是树的组数，主要把并查集构建起来，组数只要记录父节点等于自己本身的点。

版本2

//2019.11.30更新
#include <cstdio>
#include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
#include <cstring>
using namespace std;
const int N = 1e4+5;
int has[N], root[N];
int find(int x){
	if(x != root[x]) root[x] = find(root[x]);
	return root[x];
}
int main(){
	int n, k, x, m, y;
	scanf("%d", &n);
	memset(has, 0, sizeof has);
	for(int i = 0; i < N; i++) root[i] = i;
	while(n--){
		scanf("%d", &k);
		int pre = 0;
		while(k--){
			scanf("%d", &x);
			if(pre){
				int u = find(pre);
				int v = find(x);
				if(u != v) root[v] = u;	
			}
			pre = x;
			has[x] = 1;
		}
	}
	int cnt = 0, num  = 0;
	for(int i = 1; i <= N; i++){
		if(has[i]){
			num++;
			if(root[i] == i) cnt++;
		}
	}
	printf("%d %d\n", cnt, num);
	scanf("%d", &m);
	while(m--){
		scanf("%d %d", &x, &y);
		int a = find(x);
		int b = find(y);
		if(a != b) puts("No");
		else puts("Yes");
	}
	
	return 0;
}

版本1

#include<cstdio>
#include<cstring>
#define N 10010
int father[N];
int find_father(int z){
	if(father[z] == z) return z;
	else{
		int tp = find_father(father[z]);
		father[z] = tp;
		return tp;
	}
}
void Union(int a,int b){
	int faA = find_father(a);
	int faB = find_father(b);
	if(faA != faB)
	  father[faA] = faB;
} 
int main(){
	int n,k,q,x,y,tmp,max=0,id;
	memset(father,0,sizeof(father));
	scanf("%d",&n);
	for(int i = 0;i < N; i++){
		father[i] = i;
	}
	while(n--){
		scanf("%d%d",&k,&id);
		if(max < id) max = id;
		for(int i=0;i<k-1;i++){
			scanf("%d",&tmp);
			Union(id,tmp);
		    if(max < tmp) max=tmp;
		}
	}
	int cnt = 0;
	for(int i=1;i<=max;i++){
		if(father[i] == i)
		  cnt++;
	}
	printf("%d %d\n",cnt,max);
	scanf("%d",&q);
	for(int i=0;i<q;i++){
		scanf("%d%d",&x,&y);
		if(find_father(x) != find_father(y))
		   printf("No\n");
		else 
		   printf("Yes\n");
	}
	return 0;
}