zoukankan      html  css  js  c++  java
  • C

    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相连的节点的个数

    题解:通过并查集将所有的结点连接在一起,在连接两个不同的组时,将边数少的连接到变数少的连接的变数多的的上面

    AC代码:

     1 #include<iostream>
     2 
     3 using namespace std;
     4 
     5 int pre[30005];
     6 int Rank[30005];
     7 
     8 int Find(int x) {
     9     return pre[x] = pre[x] == x ? x : Find(pre[x]);
    10 }
    11 
    12 void Union(int x, int y) {
    13     int t1, t2;
    14     t1 = Find(x);
    15     t2 = Find(y);
    16     if (t1 == t2)
    17         return ;
    18     if (Rank[t1] > Rank[t2]) {
    19         pre[t2] = t1;
    20     }
    21     else {
    22         pre[t1] = t2;
    23         if (Rank[t1] == Rank[t2]) {
    24             pre[t1] = t2;
    25             Rank[t2]++;
    26         }
    27     }
    28 }
    29 
    30 int main() {
    31     int n, m;
    32     while(cin >> n >> m) {
    33 
    34         if (n == 0 && m == 0)
    35             break;
    36         // 初始化父亲节点
    37         for (int i = 0; i <= n; i++) {
    38             pre[i] = i;
    39             Rank[i] = 0;
    40         }
    41 
    42         for (int i = 1; i <= m; i ++) {
    43             int t, k, h, r, flag;
    44             cin >> t;
    45             if (t > 0)
    46                 cin >> r;
    47 
    48             for (int j = 1; j < t; j++) {
    49                 cin >> k;
    50                 Union(r, k);
    51             }
    52 
    53         }
    54         int ans = 1, cmp = Find(0);
    55 
    56         for (int i = 1; i < n; i++) {
    57             if (cmp == Find(i))
    58                 ans++;
    59         }
    60         cout << ans << endl;
    61     }
    62 
    63     return 0;
    64 }
    永远渴望,大智若愚(stay hungry, stay foolish)
  • 相关阅读:
    Error creating bean with name 'configurationPropertiesBeans'异常
    bootstrap.yml没有小绿叶,添加配置无提示,配置无法加载
    Hello from Docker
    windows jdk8 nacos-server-1.4.0本地搭建启动
    Myeclipse导入的maven项目相关依赖包无法下载
    Idea的Terminal窗口找不见
    Win10系统Win键无法使用
    git拉代码报"error: RPC failed; curl 56 OpenSSL SSL_read: SSL_ERROR_SYSCALL, errno 10054"
    团队作业6:复审与事后分析
    团队作业4:项目冲刺
  • 原文地址:https://www.cnblogs.com/h-hkai/p/8904037.html
Copyright © 2011-2022 走看看