奇奇怪怪的RE

#include<iostream>
using namespace std;
int f[5005];
void into(){
    for(int i=1 ; i<=5005 ; i++) f[i]=i;
}
int find(int x){
    if(f[x]==x) return x;
    else return f[x]=find(f[x]);
}
void merge(int x,int y){
    f[find(x)]=find(y);
}
int main(){
    int n,m;
    cin>>n>>m;
    into();
    for(int i=1 ; i<=m ; i++){
        int x,y,z;
        cin>>z>>x>>y;
        if(z==1) merge(x,y);
        if(z==2){
            if(find(x)==find(y)) cout<<"Y"<<endl;
            else cout<<"N"<<endl;
        }
    }
    return 0;
}