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
#include <iostream>
#include <unordered_set>
#include <vector>
#include <algorithm>

using namespace std;

vector<char> types;
vector<int> groupIndices;
vector<unordered_set<int>> groups;

void addTwoZeros(int a, int b) {
    if (a == b) {
        types[a] = '1';
    } else {
        groupIndices[a] = groups.size();
        groupIndices[b] = groups.size();
        groups.push_back({a, b});
        types[a] = '?';
        types[b] = '?';
    }
}

void addTwoUnknows(int a, int b) {
    if (groupIndices[a] == groupIndices[b]) {
        auto &group = groups[groupIndices[a]];
        for (auto &elem : group) {
            types[elem] = '1';
            groupIndices[elem] = -1;
        }
        group.clear();
    } else {
        auto &groupA = groups[groupIndices[a]];
        auto &groupB = groups[groupIndices[b]];
        if (groupA.size() > groupB.size()) {
            for (auto &elem : groupB) {
                groupA.insert(elem);
                groupIndices[elem] = groupIndices[a];
            }
        } else {
            for (auto &elem : groupA) {
                groupB.insert(elem);
                groupIndices[elem] = groupIndices[b];
            }
        }
    }
}

void addOneAndSecond(int second) {
    if (types[second] == '0') {
        types[second] = '1';
    } else {
        auto &group = groups[groupIndices[second]];
        for (auto &elem : group) {
            types[elem] = '1';
            groupIndices[elem] = -1;
        }
    }
}

void addZeroAndUnknown(int zero, int unknown) {
    auto &group = groups[groupIndices[unknown]];
    group.insert(zero);
    types[zero] = '?';
    groupIndices[zero] = groupIndices[unknown];
}

int main() {
    ios::sync_with_stdio(false);
    std::cin.tie(NULL);

    int n;
    int q;
    cin >> n >> q;
    types.resize(n+1, '0');
    groupIndices.resize(n+1, -1);

    for (int i = 0; i < q; ++i) {
        char oper;
        cin >> oper;
        switch (oper) {
        case '+':
            int a, b;
            cin >> a >> b;
            if (types[a] == '0' && types[b] == '0') {
                addTwoZeros(a, b);
            } else if (types[a] == '?' && types[b] == '?') {
                addTwoUnknows(a, b);
            } else if (types[a] == '1') {
                addOneAndSecond(b);
            } else if (types[b] == '1') {
                addOneAndSecond(a);
            } else if (types[a] == '0') {
                addZeroAndUnknown(a, b);
            } else {
                addZeroAndUnknown(b, a);
            }
            break;
        case '-':
            int c;
            cin >> c;
            if (types[c] == '?') {
                auto &group = groups[groupIndices[c]];
                group.erase(c);
                if (group.size() == 1) {
                    for (auto &elem : group) {
                        types[elem] = '0';
                        groupIndices[elem] = -1;
                    }
                    group.clear();
                }
                groupIndices[c] = -1;
            }
            types[c] = '0';
            break;
        case '?':
            int d;
            cin >> d;
            cout << types[d];
            break;
        }
    }
    cout << endl;
}