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
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

#define rep(i, j) for (int i = 0; i < (int)(j); i++)
#define st first
#define nd second

const int N = 2e6;

const int DONT_KNOW = 0;
const int HAVE = 1;
const int DONT_HAVE = 2;

int parent[N];
int siz[N];
int unknown[N];
int state[N];
int real_idx[N];
int nxt_idx;

int Find(int x) {
  while (parent[x] != x) {
    x = parent[x];
  }
  return x;
}

void Union(int a, int b) {
  int pa = Find(a);
  int pb = Find(b);

  if (siz[pa] < siz[pb]) {
    swap(pa, pb);
    swap(a, b);
  }

  parent[pb] = pa;
  siz[pa] += siz[pb];
  unknown[pa] += unknown[pb];
}

void fix(int x) {
  int px = Find(x);

  if (unknown[px] == 1) {
    if (state[x] == DONT_KNOW) {
      state[x] = DONT_HAVE;
      unknown[px] = 0;
    }
  } else if (unknown[px] == 0) {
    if (state[x] == DONT_KNOW) {
      state[x] = HAVE;
    }
  }
}

void broke(int x) {
  int rx = real_idx[x];

  fix(rx);

  int px = Find(rx);

  unknown[px] -= state[rx] == DONT_KNOW;

  int nx = nxt_idx++;
  real_idx[x] = nx;
  state[nx] = DONT_HAVE;
}

void add(int a, int b) {
  a = real_idx[a];
  b = real_idx[b];

  int pa = Find(a);
  int pb = Find(b);

  fix(a);
  fix(b);

  if (a == b) {
    state[a] = HAVE;
    unknown[pa] = 0;
    return;
  }

  assert(state[a] != HAVE or state[b] != HAVE);

  if (pa == pb) {
    assert(state[a] != DONT_HAVE and state[b] != DONT_HAVE);
    state[a] = HAVE;
    state[b] = HAVE;
    unknown[pa] = 0;
  }

  if (state[a] == HAVE) {
    state[b] = HAVE;
    unknown[pb] = 0;
    return;
  }

  if (state[b] == HAVE) {
    state[a] = HAVE;
    unknown[pa] = 0;
    return;
  }

  unknown[pa] += state[a] == DONT_HAVE;
  unknown[pb] += state[b] == DONT_HAVE;
  state[a] = state[b] = DONT_KNOW;
  Union(pa, pb);
}

void ask(int x) {
  x = real_idx[x];
  fix(x);

  if (state[x] == HAVE) {
    cout << 1;
  } else if (state[x] == DONT_HAVE) {
    cout << 0;
  } else {
    cout << "?";
  }
}

void TEST([[maybe_unused]] int testcase_i) {
  int n, q;
  cin >> n >> q;
  nxt_idx = n + 1;

  rep(i, N) {
    state[i] = DONT_HAVE;
    siz[i] = 1;
    parent[i] = i;
    real_idx[i] = i;
  }

  while (q--) {
    char c;
    cin >> c;
    int a, b;
    if (c == '?') {
      cin >> a;
      ask(a);
    }
    if (c == '+') {
      cin >> a >> b;
      add(a, b);
    }
    if (c == '-') {
      cin >> a;
      broke(a);
    }
  }
}

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  cout.tie(nullptr);

  cout << setprecision(20) << fixed;

  // srand(time(NULL));

  int t = 1;
  // cin >> t;
  rep(i, t) {
    TEST(i);
  }

  return 0;
}