bzoj 3223/tyvj 1729 文艺平衡树 splay tree

原题链接：http://www.tyvj.cn/p/1729
看了这么多天splay tree总算有点眉目了，O(∩_∩)O~~。
之前在网上东看西看找各种关于splay tree的资料，看了很多代码，不过大神们都喜欢
把所有的操作封装在一个结构体内，最对于不会c++的蒟蒻表示亚历山大。
自己只好亲手画出各种旋转操作，弄清各种延迟标记， 好在自己慢慢还是弄懂了一些/(ㄒoㄒ)/~~
套用某个神犇的话：只有思考过的代码，才是能AC的代码。
不说那么多了，这题是很裸的splay题，只涉及翻转区间。
代码如下：

#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#define Max_N 100100
#define _size(T) ((T)==null ? 0 : (T)->size)
typedef struct _node{
    int val, size, rev;
    struct _node *pre, *ch[2];
}splay;
splay *root, *null, stack[Max_N];
int n, m, sz = 0;
splay *_calloc(int val){
    splay *p = &stack[sz++];
    p->pre = p->ch[0] = p->ch[1] = null;
    p->val = val, p->size = 1, p->rev = 0;
    return p;
}
void pushup(splay *x){
    if (x == null) return;
    x->size = _size(x->ch[0]) + _size(x->ch[1]) + 1;
}
void update(splay *x){
    splay *t = null;
    if (x == null) return;
    x->rev ^= 1;
    t = x->ch[0];
    x->ch[0] = x->ch[1];
    x->ch[1] = t;
}
void pushdown(splay *x){
    if (x == null) return;
    if (x->rev != 0){
        x->rev ^= 1;
        update(x->ch[0]);
        update(x->ch[1]);
    }
}
void rotate(splay *x, int c){
    splay *y = x->pre;
    pushdown(y), pushdown(x);
    y->ch[!c] = x->ch[c];
    x->pre = y->pre;
    if (x->ch[c] != null) x->ch[c]->pre = y;
    if (y->pre != null) y->pre->ch[y->pre->ch[0] != y] = x;
    x->ch[c] = y;
    y->pre = x;
    pushup(y);
    if (y == root) root = x;
}
void splay_splay(splay *x, splay *f){
    if (x == root) return;
    for (; x->pre != f; pushdown(x)){
        if (x->pre->pre == f){
            rotate(x, x->pre->ch[0] == x);
        } else {
            splay *y = x->pre, *z = y->pre;
            if (z->ch[0] == y){
                if (y->ch[0] == x) rotate(y, 1), rotate(x, 1);
                else rotate(x, 0), rotate(x, 1);
            } else {
                if (y->ch[1] == x) rotate(y, 0), rotate(x, 0);
                else rotate(x, 1), rotate(x, 0);
            }
        }
    }
    pushup(x);
}
splay *built(int l, int r){
    splay *p = null;
    if (l > r) return null;
    int mid = (l + r) >> 1;
    p = _calloc(mid);
    p->ch[0] = built(l, mid - 1);
    if (p->ch[0] != null) p->ch[0]->pre = p;
    p->ch[1] = built(mid + 1, r);
    if (p->ch[1] != null) p->ch[1]->pre = p;
    pushup(p);
    return p;
}
void initialize(int l, int r){
    null = _calloc(-1);
    null->size = 0;
    root = _calloc(-1);
    root->ch[1] = _calloc(-1);
    root->ch[1]->pre = root;
    splay *x = built(l, r);
    root->ch[1]->ch[0] = x;
    x->pre = root->ch[1];
    pushup(root->ch[1]);
    pushup(root);
}
splay *select(splay *x, int k){
    int t = 0;
    splay *ret = x;
    for (;;){
        pushdown(ret);
        t = _size(ret->ch[0]);
        if (t == k) break;
        if (k < t) ret = ret->ch[0];
        else k -= t + 1, ret = ret->ch[1];
    }
    return ret;
}
void travel(splay *x){
    if (x != null){
        pushdown(x);
        travel(x->ch[0]);
        printf("%d ", x->val);
        travel(x->ch[1]);
    }
}
splay *get_range(int l, int r){
    splay_splay(select(root, l - 1), null);
    splay_splay(select(root, r + 1), root);
    return root->ch[1]->ch[0];
}
void reverse(int l, int r){
    splay *ret = get_range(l, r);
    update(ret);
}
void print(){
    splay *ret = get_range(1, n);
    travel(ret);
}
int main(){
#ifdef LOCAL
    freopen("in.txt", "r", stdin);
    freopen("out.txt", "w+", stdout);
#endif
    int a, b;
    while (~scanf("%d %d", &n, &m)){
        initialize(1, n);
        while (m--){
            scanf("%d %d", &a, &b);
            reverse(a, b);
        }
        print();
    }
    return 0;
}