徐州2019 网络赛

#include<bits/stdc++.h>
using namespace std;
unordered_map<int,int> mp;
int x,y,z,n,m;
int find(int x)
{
    return mp.count(x) ?mp[x]=find(mp[x]) :x;
}
int main()
{
    scanf("%d %d",&x,&y);
    while(y--)
    {
        scanf("%d %d",&n,&m);
        if(n==1)
            mp[m]=m+1;
        else
            printf("%d\n",find(m));
    }
}