专栏首页mlPOJ----The Suspects

POJ----The Suspects

The Suspects

Time Limit: 1000MS

Memory Limit: 20000K

Total Submissions: 18890

Accepted: 9150

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

Source

Asia Kaohsiung 2003

代码:

#include<iostream>
#include<cstdio>
#define maxn 30002
using namespace std;
int Father[maxn],rank[maxn];
void makeset(int n)                      //初始化
{
    for(int i=0;i<n;i++)
    {
        Father[i]=i;                     //以自身做根
        rank[i]=1;                      //开始高度为1
    }
}
int findset(int x)
{
    if(x!=Father[x])
    {
        Father[x]=findset(Father[x]);
    }
    return Father[x];
}

void unionset(int fx,int fy)
{
    fx=findset(Father[fx]);
    fy=findset(Father[fy]);
    if(fx==fy)
        return ;
    if(rank[fx]>rank[fy])         
    {
        Father[fy]=fx;
        rank[fx]+=rank[fy];
    }
    else
    {
        Father[fx]=fy;
        rank[fy]+=rank[fx];
    }
}
int main()
{
  int n,m,k,st,num;
  while(scanf("%d%d",&n,&m),n+m)
  {
      makeset(n);
      while(m--)
      {
       scanf("%d%d",&k,&st);
       while(--k)
       {
        scanf("%d",&num);
        unionset(st,num);
       }
      }
    printf("%d\n",rank[findset(0)]);
  }
  return 0;
}

本文参与腾讯云自媒体分享计划,欢迎正在阅读的你也加入,一起分享。

我来说两句

0 条评论
登录 后参与评论

相关文章

  • HDUOJ---Piggy-Bank

    Piggy-Bank Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K...

    Gxjun
  • hdu 1805Expressions(二叉树构造的后缀表达式)

    Expressions Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 ...

    Gxjun
  • HDUOJ-------2493Timer(数学 2008北京现场赛H题)

    Timer Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Jav...

    Gxjun
  • 分析树莓派3b+上电启动流程

    最近在玩树莓派,觉得这个树莓派的启动过程有点意思。所以在收集很多信息之后,个人也进行了一些实验和总结。先看一段原始资料:

    bigmagic
  • 贝叶斯估计中极大似然估计、拉普拉斯平滑定理以及M-估计

    英文原文链接:http://www.temida.si/~bojan/probability_estimation.php 原文: Probabilit...

    学到老
  • Fiori Globalization实现的一个具体例子 - 关于数字显示格式的处理

    This issue is copied from one of Jerry’s workshop regarding Fiori Globalization ...

    Jerry Wang
  • 具有自修改能力的有界理性代理的性能(CS AI)

    嵌入在复杂环境中的代理的自我修改是难以避免的,无论是通过直接手段(例如,自己的代码修改)还是间接手段(例如,影响操作员、利用漏洞或环境)。虽然有人认为智能代理有...

    识檐
  • How to handle the generic error Cannot read property md of undefined

    Suppose you have encountered with this error when you launch your Fiori applicat...

    Jerry Wang
  • 如何处理UI5一般性错误Cannot read property md of undefined

    Suppose you have encountered with this error when you launch your Fiori applicat...

    Jerry Wang
  • 基于进化稀疏回归的杜芬振子实验辨识方法(CS.CE)

    本文提出了一种基于进化的稀疏回归算法,并将其应用于杜芬振子装置和数值模拟数据采集的实验数据。我们的目的是确定库仑摩擦项作为系统常微分方程的一部分。利用稀疏辨识对...

    用户7236395

扫码关注云+社区

领取腾讯云代金券