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
#pragma GCC optimize ("O3")
#include <bits/stdc++.h>
using namespace std;

#define FOR(i, b, e) for(int i = (b); i < (e); i++)
#define sz(x) int(x.size())
#define all(x) x.begin(), x.end()
#define pb push_back
#define mp make_pair
#define st first
#define nd second
using ll = long long;
using vi = vector<int>;
using pii = pair<int, int>;

auto &operator<<(auto &o, pair<auto, auto> p) {
	return o << "(" << p.st << ", " << p.nd << ")"; }
auto operator<<(auto &o, auto x)->decltype(end(x), o) {
	o << "{"; int i=0; for(auto e: x) o << ", " + 2*!i++ << e;
	return o << "}"; }
#ifdef LOCAL
#define deb(x...) cerr << "[" #x "]: ", [](auto...$) { \
					((cerr << $ << "; "),...) << endl; }(x)
#else
#define deb(...)
#endif

struct UF {
	vi par, alive, cycled;

	int add() {
		int nr = sz(par);
		par.pb(nr);
		alive.pb(1);
		cycled.pb(0);
		return nr;
	}
	
	int Find(int v) {
		return v == par[v] ? v : par[v] = Find(par[v]);
	}

	void Union(int v, int u) {
		v = Find(v), u = Find(u);
		if(v == u) {
			cycled[v] = 1;
			return;
		}
		par[u] = v;
		alive[v] += alive[u];
		cycled[v] = max(cycled[v], cycled[u]);
	}
};

void solve() {
	int n, m;
	cin >> n >> m;
	vi id(n);
	UF jan;
	for(int &x: id) x = jan.add();
	string ans;
	FOR(i, 0, m) {
		char c;
		int a, b;
		cin >> c >> a;
		a--;
		if(c == '+') {
			cin >> b;
			b--;
			jan.Union(id[a], id[b]);
		}
		if(c == '-') {
			jan.alive[jan.Find(id[a])]--;
			id[a] = jan.add();
		}
		if(c == '?') {
			int repr = jan.Find(id[a]);
			if(jan.cycled[repr]) ans += '1';
			else if(jan.alive[repr] == 1) ans += '0';
			else ans += '?';
		}
	}
	cout << ans << '\n';
}

int main() {
	cin.tie(0)->sync_with_stdio(0);
	int tt = 1;
	// cin >> tt;
	FOR(te, 0, tt) solve();
	return 0;
}