#include <stdio.h>
#include <string.h>

int pre[30000];

int find(int x)
{
	int p = x, t;
	while (pre[p] > 0) p = pre[p];
	while (x != p)
	{
		t = pre[x], pre[x] = p, x = t;
	}
	return p;
}

void uni(int x, int y)
{
	int a = find(x), b = find(y);
	if (pre[a] > pre[b])
	{
        pre[b] += pre[a];
        pre[a] = b;
	}
	else
	{
		pre[a] += pre[b];
        pre[b] = a;		
	}
}

int main(void)
{
	int n, m, k, t1, t2;
	while (scanf("%d%d", &n, &m))
	{
		if (n == 0 && m == 0) break;
        memset(pre, -1, sizeof(pre));
		while (m--)
		{
			scanf("%d%d", &k, &t1);
			k--;
			while (k--)
			{
				scanf("%d", &t2);
				if (find(t1) != find(t2))
				    uni(t1, t2);
				t1 = t2;
			}
		}
		printf("%d\n", -pre[find(0)]);
	}
	return 0;
}

• Re:并查集老是WA，哪位帮忙看下代码。。 (268) yayu_myself 2009-12-27 22:37:10
  • Re:我也是，有没有人知道为什么 (3) huxin987 2011-03-30 20:45:09
• 提供我的代码，仅供参考。 (843) zerocpp 2011-04-03 00:40:37