1118. Birds in Forest (25)

#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int pre[10005];
vector<bool> visited(10005,false);
int findroot(int t)
{
if (pre[t] != t) pre[t] = findroot(pre[t]);
return pre[t];
}
void join(int x, int y)
{
int fx = findroot(x);
int fy = findroot(y);
if (fx != fy)
{
pre[max(fx, fy)] = min(fx, fy);
}
}

int main()
{
int N;
cin >> N;
for (int t = 0;t < 10005;t++)
pre[t] = t;
while (N--)
{
int n;
cin >> n;
if (n == 0) continue;
int x, y;
cin >> x;
visited[x] = true;
while (--n)
{
cin >> y;
join(x, y);
visited[y] = true;
}
}
int cnt1 = 0,cnt2=0;
for (int t = 0;t < 10005;t++)
{
if (visited[t])
{
cnt2 = max(cnt2, t);
if (pre[t] == t)
cnt1++;
}
}

cin >> N;
cout << cnt1 << " " << cnt2 << endl;
while (N--)
{
int a, b;
cin >> a >> b;
if (findroot(a) == findroot(b))
cout << "Yes" << endl;
else cout << "No" << endl;
}
}