HDU 1213 How Many Tables
原题链接:vjudge传送门
题目大意:
给定n个人,m组关系(两人之间),关系可以传递,问总最终共有几组关系
eg:若a和b有关系,b和c有关系,则a,b,c都有关系,且为同一组关系
具体思路:
并查集
具体代码:
#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
int const N = 1000+10;
int fa[N];
int visit[N]; //用于统计多少组关系
int n, m;
void init()
{
for (int i = 0; i <= n; i++)
fa[i] = i;
}
int find(int i)
{
if (i != fa[i])
fa[i] = find(fa[i]);
return fa[i];
}
void unite(int i, int j)
{
int x = find(i);
int y = find(j);
if (x == y)return;
fa[x] = y;
}
int main()
{
int T;
scanf("%d", &T);
while (T--)
{
memset(visit, 0, sizeof(visit));
scanf("%d%d", &n, &m);
init();
for (int i = 1; i <= m; i++)
{
int x, y;
scanf("%d%d", &x,&y);
unite(x, y);
}
int sum=0;
for (int i = 1; i <= n; i++) {
visit[find(i)] = 1;
if (visit[i])sum++;
}
printf("%d\n", sum);
}
return 0;
}