题目链接
题目分析:
(略)
解题思路:
找出结点共组成几个集合,输出集合数-1即为需要修建的道路条数。
使用并查集。
AC程序(C++):
/**************************
*@Author: 3stone
*@ACM: HDU.1232 畅通工程
*@Time: 18/6/12
*@IDE: VS Code
***************************/
#include<cstdio>
#include<algorithm>
#include<cstring>
#define maxn 1005
using namespace std;
int far[maxn]; //并查集
//初始化
void initiate(int n) {
for (int i = 0; i <= n + 1; i++)
far[i] = i;
}
//查找根节点(迭代版)
int find_root(int a) {
int root = a;
while(root != far[root])
root = far[root];
//路径压缩(再回溯一遍,把走过结点的父节点全部赋值为根结点)
while(a != far[a]) {
int z = a;
a = far[a];
far[z] = root;
}
return root;
}
//合并集合
void Union(int a, int b) {
a = find_root(a);
b = find_root(b);
if (a != b)
far[b] = a;
}
int main() {
int n, m, a, b;
int sum_of_set; //集合数
while(scanf("%d", &n) != EOF) {
if (n == 0) //输入结束
break;
scanf("%d", &m);
initiate(n);
for (int i = 1; i <= m; i++) {//user序号从1开始
scanf("%d%d", &a, &b);
Union(a, b);
}//for - i
//统计集合数
sum_of_set = 0;
for(int i = 1; i <= n; i++) {
if (i == far[i])
sum_of_set++;
}
printf("%d\n", sum_of_set - 1); //集合数
}//while
return 0;
}