-
Notifications
You must be signed in to change notification settings - Fork 21
/
kuangbin带飞并查集2.cpp
60 lines (60 loc) · 1.21 KB
/
kuangbin带飞并查集2.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
#include<iostream>
#include <cstdio>
#include<queue>
#include<string>
#include<algorithm>
#include<map>
#include <cstring>
#include<queue>
#include<vector>
#include<cmath>
#include<set>
using namespace std;
typedef long long ll;
int n,m,p,t,st;
int f[30005];
void init()
{
for(int i=0;i<n;i++)
f[i]=i;
}
int found(int x)
{
if(f[x]!=x)
return f[x]=found(f[x]);
return x;
}
void mix(int x,int y)
{
int lx=found(x);
int ly=found(y);
if(lx!=ly)
{
f[ly]=lx;
}
}
int main()
{
while(scanf("%d %d", &n,&m)!=EOF&&(m||n))
{
int ans=0;
init();
while(m--)
{
scanf("%d",&p);
scanf("%d",&st);
for(int i=1;i<p;i++)
{
scanf("%d",&t);
mix(st,t);
}
}
t=found(0);
for(int i=0;i<n;i++)
{
if(found(i)==t) ans++;
}
printf("%d\n",ans);
}
return 0;
}