题意:
给定0-n-1个学生,以及m个分组
求所有与0同组的个数
解法:
并查集,每一组合选择任一结点作合并操作,维护数组d表示以该结点为根的子结点(包括自己)的个数
d[find(0)]就是答案
#include <iostream>
#include <vector>
#include <map>
#include <list>
#include <set>
#include <deque>
#include <stack>
#include <queue>
#include <algorithm>
#include <cmath>
#include <cctype>
#include <cstdio>
#include <iomanip>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <string>
#include <sstream>
#include <cstring>
#include <queue>
using namespace std;
///宏定义
const int INF = 990000000;
const int maxn = 32210 ;
const int MAXN = maxn;
///全局变量 和 函数
int max(int a, int b)
{
return a > b ? a : b;
}
int n, m;
int parent[maxn];
int d[maxn];
int find(int x)
{
if (parent[x] != x)
{
int root = find(parent[x]);
return parent[x] = root;
}
else
return x;
}
void union_set(int x, int y)
{
int r1 = find(x);
int r2 = find(y);
if (r1 != r2)
{
parent[r1] = r2;
d[r2] += d[r1];
}
}
int main()
{
///变量定义
int i, j;
while(scanf("%d %d", &n, &m) != EOF)
{
if (m == 0 && n == 0)
break;
for (i = 0; i <= n; i++)
{
parent[i] = i;
d[i] = 1;
}
int cnt = 0;
for (i = 0; i < m; i++)
{
vector<int> vec;
int k;
scanf("%d", &k);
while (k--)
{
int num;
scanf("%d", &num);
vec.push_back(num);
}
sort(vec.begin(), vec.end());
int s = vec[0];
int root = find(s);
for (j = 1; j < vec.size(); j++)
{
int temp = vec[j];
int r2 = find(temp);
if (r2 != root)
{
union_set(r2, root);
}
}
}
printf("%d\n", d[find(0)]);
}
///结束
return 0;
}