Algorithm πŸ§‘πŸ»‍πŸ’»/Note

[C++, ν…œν”Œλ¦Ώ] μœ λ‹ˆμ˜¨ νŒŒμΈλ“œ

dkswnkk 2022. 9. 2. 13:13

μœ λ‹ˆμ˜¨ νŒŒμΈλ“œ

#include <iostream>
#define MAX 100001
using namespace std;

int N, M, ans;
int parent[MAX];

int find_parent(int a){
    if(a == parent[a]) return a;
    return parent[a] = find_parent(parent[a]);
}

void make_parent(int a, int b){
    a = find_parent(a);
    b = find_parent(b);
    if(a<b) parent[b] = a;
    else parent[a] = b;
}

int main(){
    for(int i=0; i<MAX; i++) parent[i] = i;
}