Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <vector>
- using namespace std;
- int parent[150000];
- int my_rank[150000];
- int sets_quantity;
- void make_set(int v) {
- parent[v] = v;
- my_rank[v] = 0;
- }
- int find_set(int v) {
- if (v == parent[v])
- return v;
- return find_set(parent[v]);
- }
- void union_sets(int a, int b) {
- a = find_set(a);
- b = find_set(b);
- if (a != b) {
- if (my_rank[a] < my_rank[b])
- swap(a, b);
- parent[b] = a;
- if (my_rank[a] == my_rank[b])
- ++my_rank[a];
- sets_quantity -= 1;
- }
- }
- int main() {
- int n;
- cin >> n;
- sets_quantity = n;
- for (int i = 0; i < n; i++)
- make_set(i);
- for (int i = 0; i < n; i++){
- int inp;
- cin >> inp;
- union_sets(i, inp - 1);
- }
- cout << sets_quantity;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement