poj1611 The Suspects 并查集
标签:并查集
题目链接
#include <stdio.h>
int num[30005];
int father[30005];
void make_set(int x){
father[x] = x;
num[x] = 1;
}
int find_set(int x){
return x == father[x] ? father[x] : find_set(father[x]);
}
void union_(int x, int y){
x = find_set(x), y = find_set(y);
if(x == y) return ;
if(num[x] < num[y]) {
father[x] = y;
num[y] += num[x];
}
else{
father[y] = x;
num[x] += num[y];
}
}
int main(){
int n, m, t, x, y, i, j;
while(scanf("%d %d", &n, &m) && (n || m)){
for(i = 0; i < n; i++) make_set(i);
for(i = 0; i < m; i++){
scanf("%d", &t);
scanf("%d", &x);
for(j = 1; j < t; j++){
scanf("%d", &y);
union_(x, y);
}
}
printf("%d\n", num[find_set(0)]);
}
return 0;
}