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
//Sylwia Sapkowska
#include <bits/stdc++.h>
#pragma GCC optimize("O3", "unroll-loops")
using namespace std;

void __print(int x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << "'" << x << "'";}
void __print(const char *x) {cerr << '"' << x << '"';}
void __print(const string &x) {cerr << '"' << x << '"';}
void __print(bool x) {cerr << (x ? "true" : "false");}

template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ", "; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? ", " : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifdef LOCAL
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#define debug(x...)
#endif

#define int long long
typedef pair<int, int> T;
const int oo = 1e18, oo2 = 1e9+7, K = 30;
const int mod = 998244353;

void solve(){
    int n, q; cin >> n >> q;
    vector<int>curr(n+1), rep(n+q+1), sz(n+q+1, 1);
    iota(curr.begin(), curr.end(), 0);
    iota(rep.begin(), rep.end(), 0);
    vector<vector<int>>g(n+q+1);
    vector<int>known(n+q+1);
    function<int(int)>f = [&](int a){
        return a == rep[a] ? a : rep[a] = f(rep[a]); //bez kompresji sciezek miau
    };
    function<void(int, int, int)>dfs = [&](int v, int pa, int t){
        rep[v] = v;sz[v] = 1;
        known[v] = 1;
        // debug(v, g[v]);
        for (auto x: g[v]){
            if (x == pa) continue;
            dfs(x, v, t);
        }
        g[v].clear();
    };
    auto u = [&](int A, int B, int t){
        int a = f(A); int b = f(B);
        if (a == b || known[A] == 1 || known[B] == 1){
            if (a != b){
                g[A].emplace_back(B);
                g[B].emplace_back(A);
            }
            dfs(A, A, t);
            return;
        }  
        g[A].emplace_back(B);
        g[B].emplace_back(A);
        if (sz[a] < sz[b]) swap(a, b);
        sz[a] += sz[b];
        rep[b] = a;
    };
    int ptr = n+1;
    for (int t = 1; t <= q; t++){
        char c; cin >> c;
        if (c == '+'){
            int a, b; cin >> a >> b;
            u(curr[a], curr[b], t);
        } else if (c == '-'){
            int a; cin >> a;
            sz[f(curr[a])]--;
            known[a] = 0;
            curr[a] = ptr++;
        } else {
            int a; cin >> a;
            int b = f(curr[a]);
            if (sz[b] > 1) cout << "?";
            else cout << known[curr[a]];
        }
    }
    cout << "\n";
}

int32_t main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    int t = 1;
    //cin >> t;
    while (t--) solve();

    return 0;
}