hdu1232 畅通工程 并查集模板题 emm套版子就可以,但是感觉能想出这个的人很有意思 很简洁
//其实就是c
#include<stdio.h>
#include<string.h>
using namespace std;
int n, m, fa[1005], a, b, record[1005], cnt;
void Init(int size)
{
for (int i = 0; i < size; i++)
fa[i] = i;
}
int Find(int x)//此函数会压缩路径
{
if (fa[x] == x)return x;
return fa[x] = Find(fa[x]);
}
void Union(int x, int y)
{
int a = Find(x), b = Find(y);
if (a != b)fa[a] = b;
}
int main()//并查集+路径压缩为o(1)
{
while (scanf("%d", &n) && n != 0) {
scanf("%d", &m);
Init(1005); memset(record, 0, sizeof(record)); cnt = 0;
for (int i = 1; i <= m; i++) {
scanf("%d %d", &a, &b);
Union(a, b);
}
for (int i = 1; i <= n; i++) {
record[Find(i)]++;
}
for (int i = 1; i <= n; i++) {
if (record[i] > 0)cnt++;
}
printf("%d\n", cnt - 1);
}
}