POJ 1611 The Suspects 【并查集】

最新推荐文章于 2020-12-05 10:27:42 发布

SCaryon

最新推荐文章于 2020-12-05 10:27:42 发布

阅读量463

点赞数

文章标签： poj

本文链接：https://blog.csdn.net/SCaryon/article/details/72824852

版权

该博客讲述了如何利用并查集解决一个与SARS传播有关的问题，即在大学中找出所有与初始嫌疑人0号同组的嫌疑人。题目给出输入包含学生数量和团体数量，通过成员列表确定学生所属团体。解决方案是建立并查集，并通过set高效地找到所有提及的学生，从而得出嫌疑人总数。

摘要由CSDN通过智能技术生成

题面：

evere 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 c