并查集维护关系,set去重
#include<bits/stdc++.h>
using namespace std;
const int maxn = 1e4 + 7;
int n, k, x, q, u, v;
int f[maxn];
set<int> st1, st2;
int find_(int x) {
return (x == f[x] ? f[x] : (f[x] = find_(f[x])));
}
void un(int t, int x) {
f[find_(x)] = find_(f[t]);
}
int main() {
for(int i = 1; i < maxn; ++i) f[i] = i;
scanf("%d", &n);
for(int i = 0; i < n; ++i) {
scanf("%d", &k);
int t; scanf("%d", &t); st1.insert(t);
for(int j = 1; j < k; ++j) {
scanf("%d", &x); st1.insert(x);
un(t, x);
}
}
cout << st1.size() << " ";
for(auto i : st1) {
f[i] = find_(i);
st2.insert(f[i]);
//printf("%d ", f[i]);
}
cout << st2.size() << endl;
scanf("%d", &q);
for(int i = 0; i < q; ++i) {
scanf("%d%d", &u, &v);
if(f[u] == f[v]) puts("Y");
else puts("N");
}
return 0;
}