so easy（unordered_map+并查集）

There are nn points in an array with index from 11 to nn, and there are two operations to those points.

1: 1 \ x1 x marking the point xx is not available

2: 2 \ x2 x query for the index of the first available point after that point (including xx itself) .

 

样例输入

5 3
1 2
2 2
2 1

样例输出

3
1

#include <bits/stdc++.h>

using namespace std;

unordered_map<int, int> fa;

int findfa(int x)
{
    if (!fa.count(x)) return x;
    return fa[x] = findfa(fa[x]);
}

int main()
{
    int n, q;
    int op, x;
    scanf("%d %d", &n, &q);
    while (q--)
    {
        scanf("%d %d", &op, &x);
        if(op == 1) fa[x] = findfa(x + 1);
        else printf("%d\n", findfa(x));
    }
    return 0;
}