一本通1385求调

#include<bits/stdc++.h>
using namespace std;
int n,m,fa[1005],enemy[1005];
int find(int x){
	if(fa[x]==x)
		return x;
	return fa[x]=find(fa[x]);
}
void merge(int x,int y){
	fa[find(x)]=find(y);
}
int main(){
	//freopen("xxx.in","r",stdin);
	//freopen("xxx.out","w",stdout);
	//ios::sync_with_stdio(false);
	//cin.tie(0);
	char opt;
	int x,y,ct=0;
	cin>>n>>m;
	for(int i=1;i<=n;i++)
		fa[i]=i;
	for(int i=1;i<=m;i++){
		cin>>opt>>x>>y;
		if(opt=='F')
			merge(x,y);
		else{
			if(enemy[x])
				merge(enemy[x],y);
			else
				enemy[x]=y;
			if(enemy[y])
				merge(enemy[y],x);
			else
				enemy[y]=x;
		}
	}
	for(int i=1;i<=n;i++)
		if(fa[i]==i) ct++;
	cout<<ct;
	return 0;
}