考查点:并查集
思路:第一次运行因为没有预处理中算出真正的元素个数用MAXN来循环结果输出了无关元素
#define LOCAL
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <stack>
#define FOR(i, x, y) for(int i = x; i <= y; i++)
#define rFOR(i, x, y) for(int i = x; i >= y; i--)
#define MAXN 10010
#define oo 0x3f3f3f3f
using namespace std;
int fa[MAXN];
void init()
{
FOR(i,0,MAXN)
fa[i]=i;
}
int findRoot(int x)
{
int z=x;
while(x!=fa[x])x=fa[x];
while(z!=fa[z])
{
int a=z;
z=fa[z];
fa[a]=x;
}
return x;
}
void Union(int a,int b)
{
int ra=findRoot(a),rb=findRoot(b);
if(ra!=rb)
{
fa[ra]=rb;
}
}
int isRoot[MAXN];
int h[MAXN];
int cnt;
int main()
{
#ifdef LOCAL
freopen("data.in","r",stdin);
freopen("data.out","w",stdout);
#endif // LOCAL
int n,m;
init();
scanf("%d",&n);
FOR(i,1,n)
{
int k;int x;
scanf("%d",&k);
scanf("%d",&x);
h[x]++;
if(h[x]==1)cnt++;
FOR(j,1,k-1)
{
int y;
scanf("%d",&y);
h[y]++;
if(h[y]==1)cnt++;
Union(x,y);
}
}
// cout<<cnt<<endl;
FOR(i,1,cnt)
{
isRoot[findRoot(i)]++;
// cout<<findRoot(i)<<endl;
}
int sum=0;
FOR(i,1,cnt)
{
if(isRoot[i]){
sum++;
// cout<<isRoot[i]<<endl;
}
}
printf("%d %d\n",sum,cnt);
scanf("%d",&m);
while(m--)
{
int u,v;
scanf("%d%d",&u,&v);
int ru=findRoot(u);
int rv=findRoot(v);
if(ru==rv)printf("Yes\n");
else printf("No\n");
}
return 0;
}