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
#include <vector>
#include <cstdio>
#include <stack>
#include <algorithm>
#include <queue>
#include <map>
#include <cmath>
#include <unordered_set>
#include <unordered_map>
#include <set>
#include <cstring>
#include <bitset>
#include <iostream>
#include <queue>
#include <iomanip>
#include <complex>

using namespace std;

#define ALL(x) x.begin(), x.end()
#define UNIQUE(c) (c).resize(unique(ALL(c)) - (c).begin())
#define FOR(i, a, b) for(int i =(a); i <=(b); ++i)
#define RE(i, n) FOR(i, 1, n)
#define RED(i, n) FORD(i, n, 1)
#define FORD(i, a, b) for(int i = (a); i >= (b); --i)
#define REP(i, n) for(int i = 0;i <(n); ++i)
#define REPD(i, n) FORD(i, n-1,0)


const int maxn = 1500022;
const long long mod = 998244353, inf = 1000000000;
int n, p[maxn], si[maxn], id[maxn], il[maxn], q, a, b, il2[maxn];
string z;
int find(int x){
    if(p[x] != x)p[x] = find(p[x]);
    return p[x];
}

void uni(int x, int y){
    int xx = find(x), yy = find(y);
    if(xx != yy){
        if(si[xx] > si[yy]){
            si[xx] += si[yy];
            il[xx] += il[yy];
            il2[xx] += il2[yy];
            p[yy] = xx;
        } else {
            si[yy] += si[xx];
            il[yy] += il[xx];
            il2[yy] += il2[xx];
            p[xx] = yy;
        }
    }
}

void solve() {
    cin>>n>>q;
    RE(i, n){
        p[i] = i;
        il2[i] = 1;
        si[i] = 1;
        id[i] = i;
    }
    while (q--){
        cin>>z>>a;
        if(z[0] == '?'){
            a = find(id[a]);
            if(il2[a] == il[a]){
                cout<<"1";
                continue;
            }
            if(il2[a] == 1){
                cout<<"0";
                continue;
            }
            cout<<"?";
        }
        if(z[0] == '+') {
            cin>>b;
            a = id[a]; b = id[b];
            uni(a, b);
            a = find(a);
            il[a]++;
        }
        if(z[0] == '-') {
            int pom = find(id[a]);
            il2[pom]--;
            il[pom]--;
            id[a] = ++n;
            p[n] = n;
            si[n] = 1;
            il2[n] = 1;
        }
    }
    cout<<"\n";
}

int main() {
    ios_base::sync_with_stdio(false), cin.tie(nullptr);
    int tt = 1;
//    cin >> tt;
    while (tt--) {
        solve();
    }
    return 0;
}