1118 Birds in Forest （25 分）（并查集）

最新推荐文章于 2020-07-07 17:59:07 发布

小火汁猛猛

最新推荐文章于 2020-07-07 17:59:07 发布

阅读量344

点赞数 1

分类专栏： c++ 文章标签： PAT

本文链接：https://blog.csdn.net/qq_42068614/article/details/85613971

版权

c++ 专栏收录该内容

115 篇文章 0 订阅

订阅专栏

Some scientists took pictures of thousands of birds in a forest. Assume that all the birds appear in the same picture belong to the same tree. You are supposed to help the scientists to count the maximum number of trees in the forest, and for any pair of birds, tell if they are on the same tree.

Input Specification:

Each input file contains one test case. For each case, the first line contains a positive number N (≤104) which is the number of pictures. Then N lines follow, each describes a picture in the format:

K B1 B2 ... BK

where K is the number of birds in this picture, and Bi's are the indices of birds. It is guaranteed that the birds in all the pictures are numbered continuously from 1 to some number that is no more than 104.

After the pictures there is a positive number Q (≤104) which is the number of queries. Then Q lines follow, each contains the indices of two birds.

Output Specification:

For each test case, first output in a line the maximum possible number of trees and the number of birds. Then for each query, print in a line Yes if the two birds belong to the same tree, or No if not.

Sample Input:

3 10 1 2

2 3 4

4 1 5 7 8

3 9 6 4

10 5

3 7

Sample Output:

2 10

Yes

#include <iostream>
#include <algorithm>
#include <cstdio>
#include <vector>
#include <stack>
#include <cmath>
using namespace std;
const int maxn=10010;
vector<int> father(maxn,-1);
int findFather(int n){//找爸爸
    if(father[n]==-1) return n;
    else{
        int f=findFather(father[n]);
        father[n]=f;
        return f;
    }
}
void uni(int a,int b){
    int fa=findFather(a);
    int fb=findFather(b);
    if(fa!=fb) father[fa]=fb;//把a放到b里面
}
int main()
{
    int n,k,b1,b2,maxb=0;
    cin>>n;
    for(int i=0;i<n;i++){
        cin>>k>>b1;
        maxb=max(b1,maxb);
        for(int j=0;j<k-1;j++){
            cin>>b2;
            maxb=max(b2,maxb);
            uni(b1, b2);
        }
    }
    int cnt=0;
    for(int i=1;i<=maxb;i++){
        if(father[i]==-1) cnt++;
    }
    cout<<cnt<<" "<<maxb<<endl;
    int q;
    cin>>q;
    for(int i=0;i<q;i++){
        int a,b;
        cin>>a>>b;
        if(findFather(a)==findFather(b)) cout<<"Yes"<<endl;
        else cout<<"No"<<endl;
    }
    return 0;
}