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
#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for (int i=a;i<n;i++)
#define per(i,a,n) for (int i=n-1;i>=a;i--)
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
typedef vector<int> VI;
typedef basic_string<int> BI;
typedef long long ll;
typedef pair<int,int> PII;
typedef double db;
mt19937 mrand(1); 
const ll mod=1000000007;
int rnd(int x) { return mrand() % x;}
ll powmod(ll a,ll b) {ll res=1;a%=mod; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}
ll gcd(ll a,ll b) { return b?gcd(b,a%b):a;}
// head

const int M=1301000,N=301000;
int n,q,gr[N],st[N];
int sz[M];
char s[11];
VI peo[M];

int main() {
	scanf("%d%d",&n,&q);
	rep(i,1,n+1) {
		gr[i]=i,sz[i]=1,st[i]=0;
		peo[i].pb(i);
	}
	int tot=n;
	rep(i,0,q) {
		scanf("%s",s);
		int x,y;
		if (s[0]=='?') {
			scanf("%d",&x);
			if (st[x]==1) {
				putchar('1');
			} else if (sz[gr[x]]==1) {
				putchar('0');
			} else {
				putchar('?');
			}
		} else if (s[0]=='+') {
			scanf("%d%d",&x,&y);
			assert(!(st[x]&&st[y]));
			if (st[x]) x=y; else if (st[y]) y=x;
			if (gr[x]==gr[y]) {
				int v=gr[x];
				for (auto z:peo[v]) if (gr[z]==v) {
					st[z]=1;
				}
			} else {
				if (SZ(peo[gr[x]])<SZ(peo[gr[y]])) swap(x,y);
				int v=gr[y],u=gr[x];
				for (auto z:peo[v]) if (gr[z]==v) {
					gr[z]=u; peo[u].pb(z); sz[u]++;
				}
			}
		} else if (s[0]=='-') {
			scanf("%d",&x);
			if (st[x]) {
				++tot;
				st[x]=0; gr[x]=tot;
				peo[tot].pb(x); sz[tot]=1;
			} else {
				sz[gr[x]]--;
				++tot; gr[x]=tot;
				peo[tot].pb(x); sz[tot]=1;
			}
		}
	}
	puts("");
}