9.6.3并查集：好朋友

最新推荐文章于 2024-09-27 11:26:03 发布

二脸

最新推荐文章于 2024-09-27 11:26:03 发布

阅读量178

点赞数

分类专栏：算法笔记

本文链接：https://blog.csdn.net/adoge_/article/details/123120863

版权

c++

算法笔记专栏收录该内容

21 篇文章 0 订阅

订阅专栏

思路好像也比较简单，就只贴一下代码

#include <iostream>

using namespace std;
const int N=110;
int father[N];
bool isRoot[N];
int findfather(int x){
    int a = x;
    while (x != father[x]){
        x=father[x];
    }
    return x;
}
void unionxy(int x,int y){
    int fathX = findfather(x);
    int fathY = findfather(y);
    if(fathX != fathY){
        father[fathX] = fathY;
    }
}
void init(int n){
    for (int i = 1; i <= n; ++i) {
        father[i] = i;
        isRoot[i] = false;
    }
}
int main() {
    int n,m;
    cin>>n>>m;
    init(n);
    int a,b;
    for (int i = 0; i < m; ++i) {
        cin>>a>>b;
        unionxy(a,b);
    }
    for (int i = 1; i <= m; ++i) {
        isRoot[findfather(i)] = true;
    }
    int ans=0;
    for (int i = 1; i <= m ; ++i) {
        ans += isRoot[i];
    }
    cout<<ans;
}