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
|
#include <bits/stdc++.h>
const int MAXN = 10010;
struct Node *null;
struct Node {
Node *c[2], *fa;
bool rev;
Node *top;
inline void maintain() {
}
inline void reverse() {
rev ^= 1, std::swap(c[0], c[1]);
}
inline void pushDown() {
rev ? c[0]->reverse(), c[1]->reverse(), rev = false : 0;
}
inline bool relation() {
return this == fa->c[1];
}
inline bool check() {
return this == fa->c[relation()];
}
inline void preview() {
if (check()) fa->preview();
pushDown();
}
inline void rotate(bool f) {
Node *o = fa;
top = o->top;
o->pushDown(), pushDown();
(fa = o->fa)->c[o->relation()] = this;
(o->c[f] = c[!f])->fa = o;
(c[!f] = o)->fa = this;
o->maintain();
}
inline void splay() {
Node *o = fa;
bool f;
for (pushDown(); o != null; o = fa) {
if (o->fa == null) {
rotate(o->c[1] == this);
} else {
(f = o->c[1] == this) == (o->fa->c[1] == o)
? (o->rotate(f), rotate(f)) : (rotate(f), rotate(!f));
}
}
maintain();
}
inline void expose(Node *p = null) {
splay();
if (c[1] != null)
c[1]->top = this, c[1]->fa = null;
(c[1] = p)->fa = this;
maintain();
}
inline Node *access() {
Node *x = this;
for (x->expose(); x->top; x = x->top)
x->top->expose(x);
return x;
}
inline void makeRoot() {
access(), splay(), reverse();
}
inline void link(Node *f) {
Node *x = access();
x->reverse(), x->top = f;
}
inline void cut(Node *y) {
Node *x = this;
x->expose(), y->expose();
if (x->top == y) x->top = NULL;
if (y->top == x) y->top = NULL;
}
inline Node *findRoot() {
Node *f = this;
f->access(), f->splay();
while (f->pushDown(), f->c[0] != null) f = f->c[0];
return f;
}
} pool[MAXN];
inline void init() {
null = pool, null->fa = null;
}
inline char nextChar() {
static const int IN_LEN = 1000000;
static char buf[IN_LEN], *s, *t;
if (s == t) {
t = (s = buf) + fread(buf, 1, IN_LEN, stdin);
if (s == t) return -1;
}
return *s++;
}
inline int read() {
static int x = 0;
static char c;
for (x = 0, c = nextChar(); !isdigit(c); c = nextChar());
for (; isdigit(c); c = nextChar())
x = (x + (4 * x) << 1) + (c ^ '0');
return x;
}
char obuf[1000000], *oh = obuf;
int n, m;
int main() {
#ifndef ONLINE_JUDGE
freopen("in.in", "r", stdin);
#endif
init();
n = read(); m = read();
char c;
for (register int i = 1; i <= n; i++) pool[i] = (Node) { null, null, null };
for (int i = 1; i <= m; ++i) {
while (c = nextChar(), c < 'A' || c > 'Z');
if (c == 'Q') {
if ((pool + read())->findRoot() == (pool + read())->findRoot()) {
*oh++ = 'Y', *oh++ = 'e', *oh++ = 's', *oh++ = '\n';
} else {
*oh++ = 'N', *oh++ = 'o', *oh++ = '\n';
}
} else if (c == 'C') {
(pool + read())->link(pool + read());
} else {
(pool + read())->cut(pool + read());
}
}
fwrite(obuf, 1, oh - obuf, stdout);
return 0;
}
|
