1118. Birds in Forest (25)

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:
4
3 10 1 2
2 3 4
4 1 5 7 8
3 9 6 4
2
10 5
3 7
Sample Output:
2 10
Yes
No

题目大意:


代码:

#include<stdio.h>
int F[10001];
int visited[10001];
int cnt[10001];
int find(int x) {
    int a = x;
    while(x != F[x])
        x = F[x];
    while(a != F[a]) {
        int z = a;
        a = F[a];
        F[z] = x;
    }
    return x;
}
void Union(int x,int y)
{
    int fx=find(x);
    int fy=find(y);
    if(fx!=fy)
        {
            F[fx]=fy;
        }
}
int main()
{
    int i,j,n,m,k,t,first,numtree=0,numbird=0,bird1,bird2;
    for(i=1;i<=10000;i++)
        F[i]=i;
    scanf("%d",&n);
    for(i=0;i<n;i++)
    {
        scanf("%d %d",&m,&first);
        visited[first]=1;
        for(j=1;j<m;j++)
        {
           scanf("%d",&k);
           Union(first,k);
           visited[k]=1;
        }
    }
    for(i=1;i<=10000;i++)
    {
        if(visited[i]==1)
        {
            int root=find(i);
            cnt[root]++;
        }
    }
    for(i=1;i<=10000;i++)
    {
        if(cnt[i]!=0)
        {
           numtree++;
            numbird+=cnt[i];
        }
    }
    printf("%d %d\n",numtree,numbird);
    scanf("%d",&t);
    for(i=0;i<t;i++)
    {
       scanf("%d %d",&bird1,&bird2);
       if(find(bird1)==find(bird2))
       {
           printf("Yes\n");
       }
       else
       {
           printf("No\n");
       }
    }
    return 0;
}

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值