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
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
// Krzysztof Łukasiewicz
// O(n log n + q) solution
//#pragma GCC optimize("O3")
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
using namespace std;
namespace debug {
template <class c> struct rge { c b, e; };
template <class c> rge<c> range(c i, c j) { return rge<c>{i, j}; }
template <class c> char spk(...);
template <class c> auto spk(c *a) -> decltype(cerr << *a, 0);
struct stream {
  ~stream() { cerr << endl; }
  template <class c>
  typename enable_if<sizeof spk<c>(0) != 1, stream &>::type operator<<(c i) {
    cerr << boolalpha << i;
    return *this;
  }
  template <class c>
  typename enable_if<sizeof spk<c>(0) == 1, stream &>::type operator<<(c i) {
    return *this << range(begin(i), end(i));
  }
  template <class a, class b> stream &operator<<(pair<a, b> p) {
    return *this << "(" << p.first << ", " << p.second << ")";
  }
  template <class c> stream &operator<<(rge<c> d) {
    *this << "[";
    for (auto it = d.b; it != d.e; it++)
      *this << ", " + 2 * (it == d.b) << *it;
    return *this << "]";
  }
  stream &_dbg(const string &s, int i, int b) { return *this; }
  template <class c, class... cs>
  stream &_dbg(const string &s, int i, int b, c arg, cs... args) {
    if (i == (int)(s.size()))
      return (*this << ": " << arg);
    b += (s[i] == '(') + (s[i] == '[') + (s[i] == '{') - (s[i] == ')') -
         (s[i] == ']') - (s[i] == '}');
    return (s[i] == ',' && b == 0)
               ? (*this << ": " << arg << "     ")._dbg(s, i + 1, b, args...)
               : (s[i] == ' ' ? *this : *this << s[i])
                     ._dbg(s, i + 1, b, arg, args...);
  }
};
} // namespace debug
#ifdef DEBUG
#define dout debug::stream()
#define dbg(...)                                                               \
  ((dout << "line:" << __LINE__ << " >> ")                                     \
       ._dbg(#__VA_ARGS__, 0, 0, __VA_ARGS__))
#else
#define dout
#define dbg(...)
#endif
// ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

const int N = 3e5 + 7;

vector<vector<int>> group;
vector<int> computers;
int group_id[N], ind[N];

int NewId() {
  int x = group.size();
  group.push_back({});
  computers.push_back(0);
  return x;
}

void Erase(int v) {
  if (group[group_id[v]].size() == 1)
    return;
  int g = group_id[v];
  ind[group[g].back()] = ind[v];
  swap(group[g][ind[v]], group[g].back());
  group[g].pop_back();
  g = NewId();
  group_id[v] = g;
  group[g].push_back(v);
  ind[v] = 0;
}

void Init(int n) {
  iota(group_id, group_id + n + 1, 0);
  computers.resize(n + 1, 0);
  group.resize(n + 1, {});
  fill(ind, ind + n + 1, 0);
  for (int i = 1; i <= n; i++) {
    group[i].push_back(i);
  }
}

void Union(int a, int b) {
  a = group_id[a];
  b = group_id[b];
  if (a == b)
    return;
  if (group[a].size() < group[b].size())
    swap(a, b);
  computers[a] += computers[b];
  for (int v : group[b]) {
    group_id[v] = a;
    ind[v] = group[a].size();
    group[a].push_back(v);
  }
  group[b].clear();
}

void RemoveComputer(int v) {
  computers[group_id[v]]--;
  Erase(v);
}

bool IsFull(int v) {
  return computers[group_id[v]] == group[group_id[v]].size();
}

void AddComputer(int a, int b) {
  Union(a, b);
  computers[group_id[a]]++;
}

void Query(int v) {
  if (computers[group_id[v]] == 0) {
    cout << 0;
  } else if (computers[group_id[v]] == group[group_id[v]].size()) {
    cout << 1;
  } else {
    cout << '?';
  }
}

int main() {
  cin.tie(nullptr);
  ios_base::sync_with_stdio(false);
  int n, q;
  cin >> n >> q;
  Init(n);
  while (q--) {
    char c;
    cin >> c;
    if (c == '?') {
      int v;
      cin >> v;
      Query(v);
    } else if (c == '+') {
      int a, b;
      cin >> a >> b;
      AddComputer(a, b);
    } else {
      int v;
      cin >> v;
      RemoveComputer(v);
    }
  }
  cout << '\n';

  return 0;
}