天梯赛 L2 部落

题目链接：点击打开链接

思路：天梯赛

#include <bits/stdc++.h>
using namespace std;
int fa[10000];
set<int> s1,s2;
int find(int x){
	return fa[x] = (fa[x] == x?x:find(fa[x]));
}
void merge(int a,int b){
	int x = find(a);
	int y = find(b);
	if(x != y){
		fa[x] = y;
	}
}
int main(){
	int n,k,fir,sec;
	for(int i = 1;i < 10000;i++){
		fa[i] = i;
	}
	cin >> n;
	for(int i = 0;i < n;i++){
		cin >> k;
		cin >> fir;
		s1.insert(fir);
		for(int j = 1;j < k;j++){
			cin >> sec;
			s1.insert(sec);
			merge(fir,sec);
		}
    }
    for(set<int>::iterator it = s1.begin();it != s1.end();it++){
    	int x = find(*it);
    	s2.insert(x);
	}
	cout << s1.size() << " " << s2.size() << endl;
	int q;
	cin >> q;
	while(q--){
		int a,b;
		cin >> a >> b;
		int x = find(a);
		int y = find(b);
		if(x == y) puts("Y");
		else puts("N");
	}
	return 0; 
}