poj1611

原创 2012年03月22日 00:36:12
The Suspects
Time Limit: 1000MS   Memory Limit: 20000K
Total Submissions: 13883   Accepted: 6588

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

#include<iostream>
#include<stdio.h>
using namespace std;
int a[30000+1];
int father (int v)
{
    int k=v;
    while(k!=a[k])k=a[k];
    a[v]=k;
    return k;
}
void uniont(int u,int v)
{
    int fu=father(u);
    int fv=father(v);
    if(fu!=fv)
    {
        a[fu]=fv;
    }
}
int main()
{
    int n,m;
    while(scanf("%d%d",&n,&m),n||m)
    {
        for(int i=0;i<n;i++)
        {
            a[i]=i;
        }
        for(int i=1;i<=m;i++)
        {
            int u,v,t;
            scanf("%d",&t);
            scanf("%d",&u);
            for(int j=2;j<=t;j++)
            {
                scanf("%d",&v);
                uniont(u,v);
            }
        }
        int count=1;
        int k=0;
        while(a[k]!=k)k=a[k];
        for(int i=1;i<n;i++)
        {
            int s=i;
            while(s!=a[s])s=a[s];
            if(s==k)++count;
        }
        printf("%d\n",count);
    }
    return 0;
}


版权声明:本文为博主原创文章,未经博主允许不得转载。

相关文章推荐

poj 1611 The Suspects 代码

POJ 1611 The Suspects(带权并查集)

题意:有中文,不译。 解题思路:将每个个体的权值当做1,最后就是求和0相同根节点的总权值,也就是多少个个体。就成了一个带权并查集,在合并时,将被合并的根节点元素所拥有的总权值,交给新的根节点,简单题...

POJ - 1611 The Suspects(并查集)

The SuspectsTime Limit: 1000MS Memory Limit: 20000K Total Submissions: 41017 Accepted: ...

【POJ】1611 The Suspects

Description Severe acute respiratory syndrome (SARS), an atypical pneumonia of unknown aetiology,...

POJ 1611 The Suspects【简单并查集】

The Suspects Time Limit: 1000MS   Memory Limit: 20000K Total Submissions: 30033   ...

poj 1611 并查集模板

poj题解

poj 1611 The Suspects

如有错误,欢迎大神指出!!! 人一我百,人十我万!! 简单的并查集 ac code: #include #include #include #in...

poj1611The Suspects

The Suspects Time Limit: 1000MS   Memory Limit: 20000K Total Submissions: 28104   ...
  • z8110
  • z8110
  • 2015-09-19 15:13
  • 164

poj 1611 The Suspects(并查集)

The Suspects Time Limit: 1000MS   Memory Limit: 20000K Total Submissions: 24247   ...

POJ 1611 The Suspects 并查集

N - The Suspects Time Limit:1000MS     Memory Limit:20000KB     64bit IO Format:%lld & %...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:深度学习:神经网络中的前向传播和反向传播算法推导
举报原因:
原因补充:

(最多只允许输入30个字)