-
Notifications
You must be signed in to change notification settings - Fork 23
/
1611.cpp
76 lines (75 loc) · 1.17 KB
/
1611.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
#include <cstdio>
using namespace std;
int main()
{
int n, m, father[30005], groupid[30005];
while (scanf("%d%d", &n, &m))
{
if (n==0 && m==0)
{
break;
}
int i,j,k;
for (i = 0; i <= n; i++)
{
father[i] = i;
}
for (i = 0; i < m; i++)
{
int d;
int fatherid = 9999999;
scanf("%d", &d);
if (d == 0)
{
continue;
}
for (j = 0; j < d; j++)
{
scanf("%d", groupid+j);
int root = father[groupid[j]];
do
{
root = father[root];
}
while (root != father[root]);
if (root < fatherid)
{
fatherid = root;
}
}
do
{
fatherid = father[fatherid];
}
while (father[fatherid] != fatherid);
for (j = 0; j < d; j++)
{
int temp = groupid[j];
int next = temp;
do
{
temp = next;
next = father[temp];
father[temp] = fatherid;
}
while (temp != next);
}
}
int sicknum = 0;
for (i = 0; i <= n; i++)
{
int root = i;
do
{
root = father[root];
}
while (father[root] != root);
if (root == 0)
{
sicknum++;
}
}
printf("%d\n", sicknum);
}
return 0;
}