C++ 超时代码 求解决

#include <iostream>



using namespace std;

int n,m;
int bcj[10001];

int find(int x)
{
    while(bcj[x] != x)
        x = bcj[x];
    return x;
}

void un(int x,int y)
{
    int fx = find(x);
    int fy = find(y);
    if(fx!= fy)
        bcj[fy] = fx;
}

int main()
{
    cin >> n >> m;
    for(int i=1 ;i <= n;i ++) bcj[i] = i;
    int a,b;
    char s;
    while(m--)
    {
        cin >> s >> a >> b;
        if(s == 'M') 
        {
            un(a,b);
        }
        if(s == 'Q')
        {
            if(find(a) == find(b)) cout<<"Yes"<<endl;
            else cout<<"No"<<endl;
        }
    }
    return 0;
}