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;
}


POJ1611(并查集)

大意: Description 严重急性呼吸系统综合症( SARS), 一种原因不明的非典型性肺炎,从2003年3月中旬开始被认为是全球威胁。为了减少传播给别人的机会, 最好的策略是隔离可能的...
  • LMFQYJ
  • LMFQYJ
  • 2016年05月09日 23:58
  • 1561

POJ-1611-The Suspects (简单并查集!)

The Suspects Time Limit: 1000MS   Memory Limit: 20000K Total Submissions: 23337   ...
  • u014355480
  • u014355480
  • 2014年11月21日 09:10
  • 1146

poj 1611 The Suspects 代码

  • 2008年03月08日 09:34
  • 1KB
  • 下载

The Suspects(POJ 1611)(裸并查集)

The Suspects(POJ 1611)(裸并查集)
  • Ema1997
  • Ema1997
  • 2016年08月17日 17:38
  • 180

并查集(poj1611、2524、2492、1182)

定义:             并查集是一种树型的数据结构,用于处理一些不相交集合(Disjoint Sets)的合并及查询问题。常常在使用中以森林来表示。   集就是让每个元素构成一个单...
  • kath_y
  • kath_y
  • 2012年03月22日 22:35
  • 1349

【poj】-1611-The Suspects(找到需要的根,再找所有根为此的树枝)

Description Severe acute respiratory syndrome (SARS), an atypical pneumonia of unknown aetiology, w...
  • Bear1998
  • Bear1998
  • 2016年04月26日 15:10
  • 175

POJ 1611 记录节点数的并查集

The Suspects Time Limit: 1000MS        Memory Limit: 20000K Total Submissions: 33882        Accepted...
  • major_zhang
  • major_zhang
  • 2016年08月11日 18:13
  • 331

POJ1611-----并查集简单题

The Suspects Time Limit: 1000MS   Memory Limit: 20000K Total Submissions: 30098   Accepted: 14...
  • blue_hpu
  • blue_hpu
  • 2016年03月05日 00:55
  • 130

E - Period poj1611(kmp 计算前缀循环节)

E - Period Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u Submit Status D...
  • u013167299
  • u013167299
  • 2015年04月16日 20:46
  • 477

POJ 1611 The Suspects(并查集,简单)

B - The Suspects Time Limit:1000MS     Memory Limit:20000KB     64bit IO Format:%I64d & %I64u Su...
  • s1124yy
  • s1124yy
  • 2016年05月19日 12:06
  • 186
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:poj1611
举报原因:
原因补充:

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