1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
#include <bits/stdc++.h>

using namespace std;
using LL = long long;
#define FOR(i, l, r) for(int i = (l); i <= (r); ++i)
#define REP(i, n) FOR(i, 0, (n) - 1)
#define ssize(x) int(x.size())

template<class A, class B> auto &operator<<(ostream &o, pair<A, B> p) {
    return o << '(' << p.first << ", " << p.second << ')';
}

template<class T> auto operator<<(ostream &o, T x) -> decltype(x.end(), o) {
    o << '{'; int i = 0; for (auto e : x) o << (", ")+2*!i++ << e;
    return o << '}';
}

#ifdef DEBUG
#define debug(x...) cerr << "[" #x "]: ", [](auto... $) {((cerr << $ << "; "), ...); }(x), cerr << '\n';
#else
#define debug(...) {}
#endif


vector<int> siz, group, state, curr_index;


int fnd(int x) {
    if (group[x] == x)
        return x;
    group[x] = fnd(group[x]);
    return group[x];
}

void onion(int x, int y) {
    x = fnd(x);
    y = fnd(y);
    if (x == y) {
        state[x] = 2;
        return;
    }

    if (siz[x] < siz[y])
        swap(x, y);
    state[x] = max({state[x], state[y], 1});
    siz[x] += siz[y];
    group[y] = x;
}


int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    int n, q, x, y;
    char ch;
    cin >> n >> q;
    int m = n + q + 13;
    siz.resize(m);
    group.resize(m);
    state.resize(m);
    curr_index.resize(n + 1);
    FOR(i, 1, n) {
        siz[i] = 1;
        curr_index[i] = i;
    }
    FOR(i, 1, m - 1)
        group[i] = i;
    int last_group = n;

    while (q--) {
        cin >> ch;
        if (ch == '?') {
            cin >> x;
            x = curr_index[x];
            x = fnd(x);
            if (state[x] == 0)
                cout << "0";
            else if (state[x] == 1)
                cout << "?";
            else
                cout << "1";
        }
        else if (ch == '-') {
            cin >> x;
            int gr = fnd(curr_index[x]);
            siz[gr]--;
            if (siz[gr] == 1 && state[gr] == 1)
                state[gr] = 0;
            curr_index[x] = ++last_group;
            siz[last_group] = 1;
        }
        else {
            cin >> x >> y;
            x = curr_index[x];
            y = curr_index[y];
            onion(x, y);
        }
    }
    cout << '\n';

    return 0;
}