zoukankan      html  css  js  c++  java
  • 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
     
    #include<iostream>
    #include<string>
    #include<algorithm>
    #include<cstdio>
    #include<queue>
    #include<cstring>
    #include<cmath>
    #include<vector>
    #include<iomanip>
    #include<iostream>
    using namespace std;
    #define MAXN 30000 
    #define INF 0x3f3f3f3f
    /*
    并查集
    路径压缩,把所有与0有关的都连到0上
    */
    int pre[MAXN],n,m;
    int find(int x)
    {
        if(x==pre[x])
            return x;
        else
            return pre[x] = find(pre[x]);
    }
    void mix(int x,int y)
    {
        int fx = find(x),fy = find(y);
        if(fx!=fy)
            pre[fy] = fx;
    }
    int main()
    {
        while(cin>>n>>m)
        {
            if(n+m==0) break;
            for(int i=0;i<=n;i++)
                pre[i] = i;
            int k,t1,t2;
            for(int i=0;i<m;i++)
            {
                cin>>k;
                for(int j=0;j<k;j++)
                {
                    if(j==0)
                        cin>>t1;
                    else
                    {
                        cin>>t2;
                        mix(t1,t2);
                    }
                }
            }
            int cnt = 0,r;
            for(int i=0;i<n;i++)
            {
                int t1 = find(i),t2=find(0);
                if(t1==t2)
                    cnt++;
            }
            cout<<cnt<<endl;
        }
        return 0;
    }
  • 相关阅读:
    Zabbix监控系统详解:系统功能介绍
    Zabbix监控系统详解:ubuntu系统下软件的安装
    计算机数学基础:第二章 极限
    计算机数学基础:第一章 函数
    net 架构师-数据库-sql server-003-T-SQL 基本语句
    net 架构师-数据库-sql server-002-工具
    net 架构师-数据库-sql server-001-SQL Server中的对象
    net 架构师-数据库-sql server-触发器
    c# 设计模式
    CSS盒模型(1)——基本概念
  • 原文地址:https://www.cnblogs.com/joeylee97/p/6594657.html
Copyright © 2011-2022 走看看