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
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
#include<bits/stdc++.h>
#define FOR(i,a,b) for(int i=a;i<(int)b;++i)
#define FORD(i,a,b) for(int i=a;i>=(int)b;--i)
#define PB push_back
#define EB emplace_back
#define FI first
#define SE second
#define umap unordered_map
#define uset unordered_set
#define vi vector<int>
#define vvi vector<vi>
#define vll vector<ll>
#define vvll vector<vll>
#define vpii vector<pii>
#define pii pair<int, int>
#define pll pair<ll, ll>
#define ALL(X) (X).begin(),(X).end()
#ifndef DEBUG
#define endl (char)10
#endif
using namespace std;
using ll = long long;
using ld = long double;

template <class T>
istream& operator>> (istream& is, vector<T>& vec){
    FOR(i,0,vec.size()) is >> vec[i];
    return is;
}
template <class T>
ostream& operator<< (ostream& os, vector<T>& vec){
    for(auto& t : vec) os << t << " ";
    return os;
}
template<class T, class U>
ostream& operator<< (ostream& os, const pair<T, U>& p){
    os << p.FI << " " << p.SE;
    return os;
}
template<class T, class U>
istream& operator>> (istream& is, pair<T, U>& p){
    is >> p.FI >> p.SE;
    return is;
}

struct FindUnionDelete {

    FindUnionDelete(int n) : sets(n), idx(n, 0), nalez(n) {
        FOR(i,0,n){
            sets[i].PB(i);
            nalez[i] = i;
        }
    }

    bool merge(int x, int y) {
        if (nalez[x] == nalez[y]) return false;
        if (sets[nalez[x]].size() > sets[nalez[y]].size()) swap(x, y);
        es.push(nalez[x]);
        vi& xs = sets[nalez[x]];
        int ny = nalez[y];
        vi& ys = sets[ny];

        while(!xs.empty()){
            nalez[xs.back()] = ny;
            idx[xs.back()] = ys.size();
            ys.PB(xs.back());
            xs.pop_back();
        }
        return true;
    }

    int find(int x){
        return nalez[x];
    }

    const vi& findAll(int x) const {
        return sets[nalez[x]];
    }

    void clear(int x){
        //cout << "CLEAR " << x << ": " << nalez[x] << " " << idx[x] << ": " << sets[nalez[x]].size() << endl;
        vi& xs = sets[nalez[x]];
        if(xs.size() == 1) return;
        idx[xs.back()] = idx[x];
        swap(xs.back(), xs[idx[x]]);
        xs.pop_back();
        idx[x] = 0;
        nalez[x] = es.front();
        es.pop();
        sets[nalez[x]].PB(x);
    }

    void clearAll(int x){
        vi& xs = sets[nalez[x]];
        while(xs.size() > 1){
            nalez[xs.back()] = es.front();
            sets[es.front()].PB(xs.back());
            es.pop();
            idx[xs.back()] = 0;
            xs.pop_back();
        }
    }

    vvi sets;
    vi idx;
    vi nalez;
    queue<int> es;
};

void upewnij_tree(vector<bool>& pewniak, FindUnionDelete& fu, int x){
    for(int y : fu.findAll(x)){
        pewniak[y] = true;
    }
    fu.clearAll(x);
}

int main () {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    int n, q;
    cin >> n >> q;
    vector<bool> pewniak(n, false);
    FindUnionDelete fu(n);
    string res = "";
    while(q--){
        char c;
        int x;
        cin >> c >> x;
        x--;
        if (c == '+'){
            int y;
            cin >> y;
            y--;
            if (pewniak[x]) upewnij_tree(pewniak, fu, y);
            else if(pewniak[y] || !fu.merge(x, y)) upewnij_tree(pewniak, fu, x);
        } else if (c == '?') {
            res += (pewniak[x] ?  '1' : (fu.findAll(x).size() == 1 ? '0' : '?'));
        } else if(pewniak[x]) {
            pewniak[x] = false;
        } else {
            fu.clear(x);
        }
    }
    cout << res << endl;
}