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.
这道题的主要意思是首先输入有几个学生,几个小组,然后01号学生是被感染的,凡是与被感染的同学同一小组的都会被感染,求被感染的学生的人数。
这道的用到简单的查并集。
如果对并查集不是很了解,可以去看看这个https://www.cnblogs.com/xzxl/p/7226557.html
#include <iostream>
using namespace std;
int pre[40000], rank1[40000];
void make(int a)
{
for (int i = 0; i < a; i++)
{
pre[i]= i;
rank1[i]= 0;
}
}
int find(int x)//查找这个元素的根节点
{
while (pre[x] != x)
x = pre[x];
return x;
}
void
combine(int a, int b)//将a的根节点与b的根节点连接在一起,从而形成一个更大的集合
{
int x, y;
x= find(a);
y= find(b);
if (x == y)
return;
if (rank1[x] >rank1[y])
pre[y]= x;
else
{
if (rank1[x] <rank1[y])
pre[x]= y;
else
{
pre[x]= y;
rank1[y]++;
}
}
}
int main()
{
int n, m,sum=0;
while (cin >> n >> m && (n ||m))
{
sum= 1;
make(n);
int a1, a,b;
while (m--)
{
cin>>a1>> a;
a1--;
while (a1--)
{
cin>> b;
combine(a,b);
}
}
for (int i = 1; i < n;i++)
if (find(i) ==find(0))
sum++;
cout<< sum << endl;
}
}