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
178
| #include<cstdio>
#include<vector>
using namespace std;
int f(-1);
inline char GetCharacter() {
static char buf[2000000], *p1 = buf, *p2 = buf;
return (p1 == p2) &&
(p2 = (p1 = buf) + fread(buf, 1, 2000000, stdin), p1 == p2) ?
EOF : *p1++;
}
#define IS_DIGIT(c) (c >= '0' && c <= '9')
inline void Read(int &x) {
f = 1, x = 0;
static char c = GetCharacter();
while (!IS_DIGIT(c)) {
if (c == '-') f = -1;
c = GetCharacter();
}
while (IS_DIGIT(c)) x = x * 10 + c - '0', c = GetCharacter();
x *= f;
}
#undef IS_DIGIT
class splay_tree {
private:
struct node {
int value,delta,size;
node *left, *right, *father;
node(const int v = 0) {
value = v, delta = 0, size = 1;
left = right = father = NULL;
}
};
node *root;
int Left, Right;
node *left_node, *right_node;
vector<int> List;
inline void update(register node *x) {
if (x) x->size = (x->value < Left || x->value > Right ? 0 : 1) +
(x->left ? x->left->size : 0) +
(x->right ? x->right->size : 0);
}
#define SIZE(x) (x ? x->size : 0)
inline void push_down(register node *x) {
if (x) {
if (x->delta) {
swap(x->left, x->right);
if (x->left) x->left->delta ^= 1;
if (x->right) x->right->delta ^= 1;
x->delta = 0;
}
}
}
inline void left_rotate(register node *x) {
register node *y = x->father;
y->right = x->left;
if (x->left) x->left->father = y;
x->father = y->father;
if (y->father) {
if (y == y->father->left) y->father->left = x;
else y->father->right = x;
}
x->left = y;
y->father = x;
update(y);
update(x);
}
inline void right_rotate(register node *x) {
register node *y = x->father;
y->left = x->right;
if (x->right) x->right->father = y;
x->father = y->father;
if (y->father) {
if (y == y->father->right) y->father->right = x;
else y->father->left = x;
}
x->right = y;
y->father = x;
update(y);
update(x);
}
inline void splay(register node *x,const node *target=NULL) {
register node *y;
while (x->father != target) {
y = x->father;
if (x == y->left) {
if (y->father != target && y == y->father->left) right_rotate(y);
right_rotate(x);
} else {
if (y->father != target && y == y->father->right) left_rotate(y);
left_rotate(x);
}
}
if (!target) root = x;
}
inline node *find(register int index) {
register node *x = root;
while(1) {
if (!x) break;
push_down(x);
if (x->value < Left) {
x = x->right;
} else if (x->value > Right) x = x->left;
else if (SIZE(x->left) == index - 1) break;
else if (SIZE(x->left) >= index) x = x->left;
else index -= SIZE(x->left) + 1, x = x->right;
}
return x;
}
inline void Order(register node *x) {
if (!x) return;
push_down(x);
Order(x->left);
if (x->value >= Left && x->value <= Right) List.push_back(x->value);
Order(x->right);
}
public:
splay_tree() {
root = NULL;
}
inline void insert(const int &key) {
register node *x = root, *y = NULL;
while(1) {
if (!x) break;
y = x;
if (x->value < key) x = x->right;
else if (x->value > key) x = x->left;
}
x = new node(key);
x->father = y;
if (y) {
if (x->value > y->value) y->right = x;
else y->left = x;
}
if (!y) root = x;
update(y);
splay(x);
}
inline void init(const int &l,const int &r) {
register node *x = new node(l - 1), *y = new node(r + 1);
Left = l, Right = r;
x->size = y->size = 0;
x->right = y, y->father = x;
root = x;
left_node = x, right_node = y;
for (register int i(l); i <= r; ++i) {
insert(i);
}
}
inline void reverse(const int &l, const int &r) {
register node *x(l == Left ? left_node : find(l - 1)),
*y(r == Right ? right_node : find(r + 1));
splay(x), splay(y, x);
if (y->left) y->left->delta ^= 1;
}
inline vector<int> c_list() {
List.clear();
Order(root->left);
if (root->value >= Left && root->value <= Right)
List.push_back(root->value);
Order(root->right);
return List;
}
};
splay_tree tree;
int n, m, l, r;
int main(int argc,char **argv) {
Read(n), Read(m);
tree.init(1, n);
while (m--) {
Read(l), Read(r);
tree.reverse(l, r);
}
register vector<int> output_list = tree.c_list();
for(register int i(0), list_size(output_list.size()); i < list_size; ++i) {
printf("%d ", output_list[i]);
}
return 0;
}
|