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
#include <bits/stdc++.h>
#ifdef dbg
#define D(...) fprintf(stderr, __VA_ARGS__)
#define DD(...) D("[Debug] "#__VA_ARGS__ " = "), \
              debug_helper::debug(__VA_ARGS__), D("\n")
#include "C:\Users\wsyear\Desktop\OI\templates\debug.hpp"
#else
#define D(...) ((void)0)
#define DD(...) ((void)0)
#endif
#define rep(i, j, k) for (int i = (j); i <= (k); ++i)
#define per(i, j, k) for (int i = (j); i >= (k); --i)
#define SZ(v) int((v).size())
#define ALL(v) (v).begin(),(v).end()
#define fi first
#define se second
using ll = long long;
using pii = std::pair<int, int>;
using pll = std::pair<ll, ll>;

template<class T> void chkmn(T &x, T y) { if (y < x) x = y; }
template<class T> void chkmx(T &x, T y) { if (y > x) x = y; }

using namespace std;

const int maxn = 1500010;

int n, m, tot, fa[maxn], sz[maxn], ed[maxn], ap[maxn], id[maxn];

int find(int x) {
  return fa[x] == x ? x : fa[x] = find(fa[x]);
}

int main() {
  cin.tie(nullptr) -> ios::sync_with_stdio(false);
  cin >> n >> m, tot = n;
  rep (i, 1, n) id[i] = i, fa[i] = i, sz[i] = 1;
  while (m--) {
    string op; cin >> op;
    int x, y;
    if (op == "+") {
      cin >> x >> y, x = find(id[x]), y = find(id[y]);
      if (x == y) ed[x]++;
      else fa[x] = y, ed[y] += ed[x] + 1, sz[y] += sz[x], ap[y] += ap[x];
    } else if (op == "-") {
      cin >> x, y = find(id[x]);
      ap[y]++, id[x] = ++tot, fa[tot] = tot, sz[tot] = 1;
    } else if (op == "?") {
      cin >> x, x = find(id[x]);
      if (sz[x] == ed[x]) cout << "1";
      else if (sz[x] == ap[x] + 1) cout << "0";
      else cout << "?";
    }
  }
}