并查集合并实验

#include <bits/stdc++.h>
using namespace std;

int main() {
vector<int>p{0,1,2,3};
function<int(int)>find=[&](int x){return p[x]==x?x:p[x]=find(p[x]);};
p[find(0)]=find(1);p[find(1)]=find(2);
int components=0,size=0;for(int i=0;i<4;++i){if(find(i)==i)++components;if(find(i)==find(0))++size;}
cout<<components<<" "<<size;
}

#include <bits/stdc++.h>
using namespace std;

int main() {
vector<int>p{0,1,2,3};
function<int(int)>find=[&](int x){return p[x]==x?x:p[x]=find(p[x]);};
p[find(0)]=find(1);p[find(1)]=find(2);
int components=0,size=0;for(int i=0;i<4;++i){if(find(i)==i)++components;if(find(i)==find(0))++size;}
cout<<components<<" "<<size;
}