题意:中文题..
思路:简单并查集..见代码
#include <cstdio>
#include <queue>
#include <cstring>
#include <iostream>
#include <cstdlib>
#include <algorithm>
#include <vector>
#include <map>
#include <string>
#include <set>
#include <ctime>
#include <cmath>
#include <cctype>
using namespace std;
#define maxn 30005
#define LL long long
int cas=1,T;
int pre[maxn];
int vis[maxn];
int Find(int x)
{
int r = x;
while (r!=pre[r])
r=pre[r];
int i = x,j;
while (pre[i]!=r)
{
j=pre[i];
pre[i]=r;
i=j;
}
return r;
}
void mix(int x,int y)
{
int fx = Find(x),fy=Find(y);
if (fx>fy)
{
pre[fy]=fx;
}
else
{
pre[fx]=fy;
}
}
int a[30005];
int main()
{
int n,num;
while (scanf("%d%d",&n,&num)!=EOF)
{
if (!n && !num)
break;
for (int i = 0;i<n;i++)
pre[i]=i;
for (int i = 0;i<num;i++)
{
int k;
scanf("%d",&k);
for (int j=0;j<k;j++)
{
scanf("%d",&a[j]);
}
for (int j = 1;j<k;j++)
mix(a[0],a[j]);
}
int ans = 0;
for (int i = 0;i<n;i++)
{
if (Find(i)==Find(0))
ans++;
}
printf("%d\n",ans);
}
//freopen("in","r",stdin);
}