我也想知道啊！！！
by huayucaiji @ 2019-03-17 10:35:19
```cpp
#include<bits/stdc++.h>
using namespace std;
const int MAX_N=1000+1;
int n,m,father[MAX_N*2],ans;
int find(int x){
if(x!=father[x])
{
father[x]=find(father[x]);
}
return father[x];
}
int main(){
ios::sync_with_stdio(false);
char t;
int a,b;
cin>>n>>m;
for(int i=1;i<=2*n;i++){
father[i]=i;
}
for(int i=1;i<=m;i++){
cin>>t>>a>>b;
if(t=='F'){
a=find(a);
b=find(b);
father[a]=b;
}
else{
a+=n;
a=find(a);
b=find(b);
father[a]=b;
/*a-=n;
b+=n;
a=find(a);
b=find(b);
father[b]=a;*/
}
}
for(int i=1;i<=n;i++){
if(father[i]==i){
ans++;
}
}
cout<<ans;
}
```
by huayucaiji @ 2019-03-17 10:35:36
兄弟过了吗我也是第7个点wa了
by Ctrlv @ 2020-08-03 12:29:15