poj 1611

/*
并查集 
POJ1611主要在于压缩路径 
*/


#include <iostream>
#include <cstdio>


using namespace std;


const int MAXN = 30100;
int Parent[MAXN];
int Total[MAXN];


int Get_parent(int a)   //路径压缩 
{
if(Parent[a] == a)
return a;
else
Parent[a] = Get_parent(Parent[a]);
return Parent[a];

/*
if(Parent[i] != a)
Parent[a] = Get_parent(Parent[a]);
return Parent[a];
*/ 
}


void Merge(int a, int b)
{
int p1 = Get_parent(a);
int p2 = Get_parent(b);

if (p1 == p2)
return;

Parent[p2] = p1;
Total[p1] += Total[p2];
}


int main ()
{
int n, m, i, j, k, a, b, nSum;
while(scanf("%d%d", &n, &m) && (m || n))
{
nSum = 0;
for(i = 0; i < n; ++i)
{
Total[i] = 1;
Parent[i] = i;
}

for(i = 0; i < m; ++i)
{
scanf("%d", &k);
scanf("%d", &a);
for(j = 0; j < k - 1; ++j)
{
scanf("%d", &b);
Merge(a, b);       //将已有的合并在一起的树合并在一起
}
}
printf("%d\n", Total[Get_parent(0)]);
}
return 0;
}