并查集(B - The Suspects)

B - The Suspects
Time Limit:1000MS     Memory Limit:20000KB     64bit IO Format:%I64d & %I64u
 use MathJax to parse formulas

Description

Severe acute respiratory syndrome (SARS), an atypical pneumonia of unknown aetiology, was recognized as a global threat in mid-March 2003. To minimize transmission to others, the best strategy is to separate the suspects from others. 
In the Not-Spreading-Your-Sickness University (NSYSU), there are many student groups. Students in the same group intercommunicate with each other frequently, and a student may join several groups. To prevent the possible transmissions of SARS, the NSYSU collects the member lists of all student groups, and makes the following rule in their standard operation procedure (SOP). 
Once a member in a group is a suspect, all members in the group are suspects. 
However, they find that it is not easy to identify all the suspects when a student is recognized as a suspect. Your job is to write a program which finds all the suspects.

Input

The input file contains several cases. Each test case begins with two integers n and m in a line, where n is the number of students, and m is the number of groups. You may assume that 0 < n <= 30000 and 0 <= m <= 500. Every student is numbered by a unique integer between 0 and n−1, and initially student 0 is recognized as a suspect in all the cases. This line is followed by m member lists of the groups, one line per group. Each line begins with an integer k by itself representing the number of members in the group. Following the number of members, there are k integers representing the students in this group. All the integers in a line are separated by at least one space. 
A case with n = 0 and m = 0 indicates the end of the input, and need not be processed.

Output

For each case, output the number of suspects in one line.

Sample Input

100 4
2 1 2
5 10 13 11 12 14
2 0 1
2 99 2
200 2
1 5
5 1 2 3 4 5
1 0
0 0

Sample Output

4
1
1


这个题意思是0号同学患有传染病,只要与0号同学同组甚至只要在同一张关系网中就被视为传染病携带者,

要求找出所有的携带者

思路:

把每组同学,搜查合并,然后判断每个同学是否与0号在同一张关系网中。

AC 代码:

#include <iostream>
#include<algorithm>
#include<stdlib.h>
#include<stdio.h>
#include<string.h>
#include<math.h>
#include<deque>
#include<queue>
#include<vector>
#include<stack>
using namespace std;
int F[110000],r[110000],p[330000];
bool cmp(int a,int b)
{
    return a<b;
}
int find1(int n)
{
    int root=n;
    int temp=n;
    while(root!=F[root])
    root=F[root];
    while(temp!=root)
    {
        int t=F[temp];
        F[temp]=root;
        temp=t;
    }
    return root;
}
void union1(int x,int y)
{
    int root1=find1(x);
    int root2=find1(y);
    if(root1!=root2)
    {
        if(root1>root2)
        F[root1]=root2;
        else
        F[root2]=root1;
    }


}
int main()
{
    int n,m;


    while(scanf("%d%d",&n,&m)&&(n||m))
    {
            for(int i=0;i<n;i++)
                F[i]=i;
            memset(r,0,sizeof(r));
            int z=0;
            for(int i=0;i<m;i++)
            {
                int a;
                scanf("%d",&a);
                for(int j=0;j<a;j++)
                {
                    scanf("%d",&p[j]);
                }
                //sort(p,p+a,cmp);
                for(int j=1;j<a;j++)
                {
                    union1(p[j-1],p[j]);
                }
            }
            for(int i=0;i<n;i++)
            if(find1(0)==find1(i))
            z++;
            printf("%d\n",z);


    }


}

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值