50分求调

#include <bits/stdc++.h>
using namespace std;
int n,m,dr[5005]={0},father[5005];
int sum,cnt[5001]={0};
int find(int x){
	if(father[x]!=x)
	father[x]=find(father[x]);  
	return father[x];
}
void join(int x,int y) {
    int fx=find(x);
	int fy=find(y);  
    if(fx!=fy)
    father[y]=x;
    return;
}
int main(){
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		father[i]=i;
	}
	for(int i=1;i<m;i++){
		char opt;
		int p,q;
		cin>>opt>>p>>q;
		if(opt=='F'){
			join(p,q);
		}
		else{
			if(dr[p]==0){
				dr[p]=find(q);
			} 
            else {
            	join(q,dr[p]);
			}
            if(dr[q]==0){
            	dr[q]=find(p);
			} 
            else {
            	join(p,dr[q]);
			}
		}
	}
    for(int i=1;i<=n;i++){
    	cnt[find(i)]++;
	}
    for(int i=1;i<=n;i++){
    	if(cnt[i]!=0){
    	    sum++;	
		}
	}
    cout<<sum;
	return 0;
}