BOJ 24542 - 튜터-튜티 관계의 수 [C++]

문제

링크

풀이

#include <algorithm>
#include <iostream>
#include <vector>
#define MOD 1000000007
using namespace std;
 
vector<int> parent, sz;
 
void init_dsu(int n) {
  parent.resize(n);
  sz.resize(n);
  for (int i=0; i<n; i++) {
    parent[i] = i;
    sz[i] = 1;
  }
}
 
int find_set(int v) {
  if (v == parent[v]) return v;
  return parent[v] = find_set(parent[v]);
}
 
void union_sets(int a, int b) {
  a = find_set(a);
  b = find_set(b);
  if (a != b) {
    if (sz[a] < sz[b]) swap(a, b);
    parent[b] = a;
    sz[a] += sz[b];
  }
}
 
void solve(void) {
  int n, m; cin >> n >> m;
  init_dsu(n);
  while (m--) {
    int u, v; cin >> u >> v; u--; v--;
    union_sets(u, v);
  }
 
  long long ans = 1;
  for (int i=0; i<n; i++) {
    if (parent[i] != i) continue;
    ans = (ans * sz[find_set(i)]) % MOD;
  }
  cout << ans;
}
 
int main(void) {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
 
  solve();
  return 0;
}