30分MLE求助

#include<bits/stdc++.h>
using namespace std;
const int maxn = 1005;
int f[maxn];
int find(int x){return f[x] == x ? x : f[x] = find(f[x]);}
signed main(){
    int n,m;
    cin>>n>>m;
    for(int i = 1;i<=n;i++){
        f[i] = i;
    }
    for(int i = 1;i<=m;i++){
        int x,y,z;
        cin>>x>>y>>z;
        if(x%2==0){
            if(find(y)==find(z)){
                cout<<"Y"<<endl;
            }else{
                cout<<"N"<<endl;
            }
        }else{
            f[find(y)] = f[z];
        }
    }
}

蒟蒻第一次发帖，大佬求捞