并查集模板
#include<iostream>
using namespace std;
const int N=100010;
int cnt[N],p[N];
int find (int x)
{
if(x!=p[x])p[x]=find(p[x]);
return p[x];
}
int main()
{
int n,m;
cin>>n>>m;
for(int i=1;i<=n;i++)
{
p[i]=i;
cnt[i]=1;
}
while (m -- )
{
char c[3];
cin>>c;
if(c[0]=='C')
{
int a,b;
cin>>a>>b;
a=find(a),b=find(b);
if(a!=b)
{
p[a]=b;
cnt[b]+=cnt[a];
}
}
else if(c[1]=='1')
{
int a,b;
cin>>a>>b;
if(find(a)==find(b))
cout<<"Yes"<<endl;
else
cout<<"No"<<endl;
}
else
{
int x;
cin>>x;
cout<<cnt[find(x)]<<endl;
}
}
return 0;
}
08-19
404
11-26
1389
05-20
592