zoukankan      html  css  js  c++  java
  • [kuangbin带你飞]专题五 并查集 B

    B - The Suspects

    题目链接:https://vjudge.net/contest/66964#problem/B

    题目:

    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在一组的都被感染了,共有编号为1~n的n个人,m组,给出m组的每组人的编号,求被感染的人有多少
    思路:只要求每个人的头是不是0就行辽,是就加1
    //
    // Created by hanyu on 2019/7/23.
    //
    #include <iostream>
    #include <cstdio>
    #include <cstring>
    #include <queue>
    using namespace std;
    const int maxn=3e4+10;
    int father[maxn],res[maxn];
    struct Node{
        int x;
        int y;
    }node[maxn];
    int find(int x)
    {
        if(x==father[x])
            return x;
        return father[x]=find(father[x]);
    }
    
    void merge(int x,int y)
    {
        int xx=find(x);
        int yy=find(y);
        if(xx!=yy)
            father[xx]=yy;
    }
    int main()
    {
        int n,m;
        while(~scanf("%d%d",&n,&m))
        {
            if(n==0&&m==0)
                break;
            for(int i=0;i<n;i++)
                father[i]=i;
            int t;
            for(int i=0;i<m;i++)
            {
                scanf("%d",&t);
                for(int j=0;j<t;j++)
                {
                    scanf("%d",&res[j]);
                    if(j!=0)
                        merge(res[j-1],res[j]);
                }
            }
            int result=0;
            for(int i=0;i<n;i++)
            {
                if(find(i)==find(0))
                    result++;
            }
            printf("%d
    ",result);
        }
        return 0;
    }
    
    
  • 相关阅读:
    iOS开发WKWebView Cookie的读取与写入,与UIWebView的Cookie共享
    【拨号】iPhone拨号功能隐藏代码,值得收藏。
    iOS: 获取不变的UDID
    ios 系统设置对应URL
    iOS开发UI篇—多控制器和导航控制器简单介绍
    iOS开发UI篇—以微博界面为例使用纯代码自定义cell程序编码全过程(二)
    iOS开发UI篇—Date Picker和UITool Bar控件简单介绍
    iOS开发UI篇—程序启动原理和UIApplication
    iOS开发UI篇—常见的项目文件介绍
    iOS开发UI篇—以微博界面为例使用纯代码自定义cell程序编码全过程(一)
  • 原文地址:https://www.cnblogs.com/Vampire6/p/11233733.html
Copyright © 2011-2022 走看看