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
104
105
106
107
108
109
110
111
112
113
114
115
116
117
#include <bits/stdc++.h>
using namespace std;
using ll = long long;

#ifdef DEBUG
#include "debug.h"
#else
#define debug(...) 42
#endif

#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)

#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repp(i, n, m) for (int i = (n); i < (m); ++i)

#define repr(i, n) for (int i = (n) - 1; i >= 0; --i)
#define reppr(i, n, m) for (int i = (m) - 1; i >= (n); --i)

#define each(a,x) for(auto& a : (x))
#define sz(x) int((x).size())

using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using pi = pair<int, int>;
using pll = pair<ll, ll>;

template <typename T, typename V> void mini(T& a, V b) {if (b < a) a = b; }
template <typename T, typename V> void maxi(T& a, V b) {if (b > a) a = b; }

struct dsu {
    vi cnt, par, broken, doubled;
    int find(int x) {
        if (par[x] == x)
            return x;
        return par[x] = find(par[x]);
    }
    void merge(int a, int b) {
        a = find(a); b = find(b);
        if (a == b) {
            assert(!doubled[a]);
            doubled[a] = true;
            return;
        }
        cnt[a] += cnt[b];
        par[b] = a;
        broken[a] += broken[b];
        doubled[a] |= doubled[b];
    }
    char has(int x) {
        x = find(x);
        if (doubled[x])
            return '1';
        if (broken[x] == cnt[x] - 1)
            return '0';
        return '?';
    }
    int push() {
        int i = sz(cnt);
        cnt.push_back(1);
        par.push_back(i);
        broken.push_back(0);
        doubled.push_back(0);
        return i;
    }
    int breakk(int i) {
        i = find(i);
        ++broken[i];
        return push();
    }
};

void solve() {
    int n, q;
    cin >> n >> q;
    dsu ds;
    vi mp(n);
    rep(i, n)
        mp[i] = ds.push();

    rep(_, q) {
        char op;
        cin >> op;
        if (op == '+') {
            int a, b;
            cin >> a >> b;
            --a; --b;
            ds.merge(mp[a], mp[b]);
        }
        if (op == '-') {
            int c;
            cin >> c;
            --c;
            mp[c] = ds.breakk(mp[c]);
        }
        if (op == '?') {
            int d;
            cin >> d;
            --d;
            cout << ds.has(mp[d]);
        }
    }
    cout << '\n';
}

int main() {
#ifndef DEBUG
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
#endif
    int z = 1;
    // cin >> z;
    while (z--)
        solve();
    return 0;
}