HDU 3487 Play with Chain 伸展树splay

题目：

http://acm.hdu.edu.cn/showproblem.php?pid=3487

题意：

给定一个数n，代表有一个数列1~n，有下面两种操作：
1. CUT a b c 把区间[a,b]这一段元素切下来接到第c个元素的后面
2. FLIP a b 反转区间[a,b]

思路：

对于第一种操作，把a-1旋转为根，b+1旋转为根的右儿子，那么区间[a,b]就在根的右儿子的左子树上，然后把c旋转到根，c+1旋转到根的右儿子，那么把之间切掉的接上去；对于第二种操作，用一个lazy标记，执行到某个节点时交换左右儿子，并下传标记

总结：

总结模板的时候改搓了，TLE到死。。。

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
using namespace std;

#define key_val son[son[root][1]][0]
typedef long long ll;
const int N = 300010, INF = 0x3f3f3f3f, MOD = 1000000;
int son[N][2], pre[N], siz[N];
int key[N], val[N], lazy[N];
int root, num, cnt, cas;
int arr[N];
int n, m;
void new_node(int &x, int fa, int v)
{
    x = ++num;
    pre[x] = fa, key[x] = v;
    siz[x] = 1, lazy[x] = 0;
    son[x][0] = son[x][1] = 0;
}
void push_up(int x)
{
    siz[x] = siz[son[x][0]] + siz[son[x][1]] + 1;
}
void push_down(int x)
{
    if(lazy[x])
    {
        lazy[son[x][0]] ^= 1, lazy[son[x][1]] ^= 1;
        swap(son[x][0], son[x][1]);
        lazy[x] = 0;
    }
}
void _rotate(int x, int dir)
{
    int y = pre[x];
    push_down(y), push_down(x);
    son[y][!dir] = son[x][dir], pre[son[x][dir]] = y;
    if(pre[y]) son[pre[y]][son[pre[y]][1]==y] = x;
    pre[x] = pre[y];
    son[x][dir] = y, pre[y] = x;
    push_up(y);
}
void splay(int x, int goal)
{
    push_down(x);
    while(pre[x] != goal)
    {
        int y = pre[x];
        if(pre[y] == goal) _rotate(x, son[y][0] == x);
        else
        {
            int dir = son[pre[y]][0] == y;
            if(son[y][dir] == x) _rotate(x, !dir), _rotate(x, dir);
            else _rotate(y, dir), _rotate(x, dir);
        }
    }
    push_up(x);
    if(goal == 0) root = x;
}
//void splay(int x, int goal)
//{
//    push_down(x);
//    while(pre[x] != goal) _rotate(x, son[pre[x]][0] == x);
//    push_up(x);
//    if(goal == 0) root = x;
//}
int get_prec(int x)
{
    push_down(x);
    int t = son[x][0];
    push_down(t);
    while(son[t][1]) t = son[t][1], push_down(t);
    return t;
}
int get_subs(int x)
{
    push_down(x);
    int t = son[x][1];
    push_down(t);
    while(son[t][0]) t = son[t][0], push_down(t);
    return t;
}
int get_min(int x)
{
    push_down(x);
    while(son[x][0]) x = son[x][0], push_down(x);
    return x;
}
int get_max(int x)
{
    push_down(x);
    while(son[x][1]) x = son[x][1], push_down(x);
    return x;
}
int _find(int v)
{
    int x = root;
    push_down(x);
    while(x && key[x] != v) x = son[x][key[x]<v], push_down(x);
    return x;
}
void _delete(int v)
{
    int x = _find(v);
    if(!x) return;
    splay(x, 0);
    if(!son[root][0] || !son[root][1])
        root = son[root][0] + son[root][1], pre[root] = 0;
    else
    {
        int t = get_subs(root);
        splay(t, root);
        son[son[root][1]][0] = son[root][0], root = son[root][1];
        pre[son[root][0]] = root, pre[root] = 0;
        push_up(root);
    }
}
int get_kth(int k)
{
    int x = root;
    push_down(x);
    while(siz[son[x][0]] + 1 != k)
    {
        if(siz[son[x][0]] + 1 > k) x = son[x][0];
        else k -= (siz[son[x][0]] + 1), x = son[x][1];
        push_down(x);
    }
    return x;
}
bool _insert(int v)
{
    if(!root) new_node(root, 0, v);
    else
    {
        int x = root;
        while(son[x][key[x]<v])
        {
//            if(key[x] == v)
//            {
//                splay(x, 0);
//                return false;
//            }
            x = son[x][key[x]<v];
        }
        new_node(son[x][key[x]<v], x, v);
        splay(son[x][key[x]<v], 0);
    }
    return true;
}
void build(int &x, int l, int r, int fa)
{
    if(l > r) return;
    int mid = (l + r) >> 1;
    new_node(x, fa, mid);
    build(son[x][0], l, mid-1, x);
    build(son[x][1], mid+1, r, x);
    push_up(x);
}
int query(int l, int r)
{
    splay(get_kth(l), 0);
    splay(get_kth(r+2), root);
    return val[key_val];
}
void update(int l, int r, int v)
{
    splay(get_kth(l), 0);
    splay(get_kth(r+2), root);
    lazy[key_val] += v;
    val[key_val] += v * siz[key_val];
}
void init()
{
    root = num = 0;
    son[root][0] = son[root][1] = siz[root] = pre[root] = 0;
    key[root] = val[root] = lazy[root] = 0;
    new_node(root, 0, -INF);
    new_node(son[root][1], root, -INF);
    build(key_val, 1, n, son[root][1]);
    push_up(son[root][1]), push_up(root);
}
void cut(int a, int b, int c)
{
    splay(get_kth(a), 0);
    splay(get_kth(b+2), root);
    int tmp = key_val;
    key_val = 0;
    push_up(son[root][1]), push_up(root);
    splay(get_kth(c+1), 0);
    splay(get_subs(root), root);
    key_val = tmp, pre[key_val] = son[root][1];
    push_up(son[root][1]), push_up(root);
}
void _reverse(int a, int b)
{
    splay(get_kth(a), 0);
    splay(get_kth(b+2), root);
    lazy[key_val] ^= 1;
}
void inorder(int x)
{
    if(! x) return;
    push_down(x);
    inorder(son[x][0]);
    if(key[x] > 0) printf("%d%c", key[x], ++cnt == n ? '\n' : ' ');
    inorder(son[x][1]);
}
int main()
{
    char str[10];
    int a, b, c;
    while(scanf("%d%d", &n, &m), n != -1 || m != -1)
    {
        init();
        for(int i = 1; i <= m; i++)
        {
            scanf(" %s%d%d", str, &a, &b);
            if(str[0] == 'C')
            {
                scanf("%d", &c);
                cut(a, b, c);
            }
            else _reverse(a, b);
        }
        cnt = 0;
        inorder(root);
    }
    return 0;
}