MLE求助。。

几乎是照着题解模板改了..还是10个MLE .. 不知道为什么..

#include<cstdio>
#include<algorithm>
#include<string.h>
#include<math.h>
#define LL long long
using namespace std;

const int N = 10001;

int n, m, head[N];

int findHead(int x)
{
    if(head[x]<0) return x;
    return head[x] = findHead(head[x]);
}

//void un(int x, int y)
//{
//    int hx = findHead(x), hy = findHead(y);
//    if(head[hx]<head[hy]) { head[hx]+=head[hy]; head[hy] = hx;}
//    else {head[hy]+=head[hx]; head[hx] = hy;}
//}

//inline bool isUn(int x, int y)
//{
//    return findHead(x)==findHead(y);
//}

int main()
{
    scanf("%d%d", &n, &m);
    for(int i=1; i<=n; i++) head[i] = -1;

    int x, y, z;
    while(m--)
    {
        scanf("%d%d%d", &z, &x, &y);
        if(z==1)
        {
            // un(x, y);
            head[findHead(x)]=findHead(y);
        }
        else
        {
            if(findHead(x)==findHead(y)) printf("Y\n");
            else printf("N\n");
        }
    }

    return 0;
}