[总结]数据结构（板子）

1 splay

void rotate(int o, int kind) {
    int p = pre[o];
    ch[p][!kind] = ch[o][kind], pre[ch[o][kind]] = p;
    ch[pre[p]][ch[pre[p]][1] == p] = o, pre[o] = pre[p];
    ch[o][kind] = p, pre[p] = o;
}
void splay(int o, int goal) {
    while (pre[o] != goal) {
        if (pre[pre[o]] == goal) rotate(o, ch[pre[o]][0] == o);
        else {
            int p = pre[o], kind = ch[pre[p]][0] == p;
            if (ch[p][kind] == o) rotate(o, !kind), rotate(o, kind);
            else rotate(p, kind), rotate(o, kind);
        }
    }
    if (goal == 0) root = o;
}

2 Treap

void rotate(int &o, int kind) {
    int x = ch[o][!kind];
    ch[o][!kind] = ch[x][kind];
    ch[x][kind] = o;
    o = x;
}

3 fhq_Treap

void split(int o, int keyy, int &x, int &y) {
    if (!o) x = y = 0;
    else {
        if (key[o] <= keyy) x = o, split(ch[o][1], keyy, ch[o][1], y);
        else y = o, split(ch[o][0], keyy, x, ch[o][0]);
    }
}
int merge(int x, int y) {
    if (!x || !y) return x+y;
    if (lev[x] < lev[y]) {
        ch[x][1] = merge(ch[x][1], y);
        return x;
    }else {
        ch[y][0] = merge(x, ch[y][0]);
        return y;
    }
}

4 LCT

void rotate(int o, int kind) {
    int p = pre[o];
    ch[p][!kind] = ch[o][kind], pre[ch[o][kind]] = p;
    if (isrt[p]) isrt[o] = 1, isrt[p] = 0;
    else ch[pre[p]][ch[pre[p]][1] == p] = o;
    pre[o] = pre[p];
    ch[o][kind] = p, pre[p] = o;
}
void splay(int o) {
    push(o);
    while (!isrt[o]) {
        if (isrt[pre[o]]) rotate(o, ch[pre[o]][0] == o);
        else {
            int p = pre[o], kind = ch[pre[p]][0] == p;
            if (ch[p][kind] == o) rotate(o, !kind), rotate(o, kind);
            else rotate(p, kind), rotate(o, kind);
        }
    }
}
void access(int o) {
    int y = 0;
    while (o) {
        splay(o);
        isrt[ch[o][1]] = 1, isrt[ch[o][1] = y] = 0;
        o = pre[y = o];
    }
}
void makeroot(int o) {
    access(o), splay(o);
    rev[o] ^= 1, swap(ch[o][0], ch[o][1]);
}
void link(int x, int y) {
    makeroot(x); pre[x] = y;
}
void cut(int x, int y) {
    makeroot(x), access(y), splay(y);
    ch[y][0] = pre[x] = 0, isrt[x] = 1;
}

5 左偏树

int merge(int a, int b) {
    if (!a || !b) return a+b;
    if (key[a] > key[b]) swap(a, b);
    ch[a][1] = merge(ch[a][1], b);
    if (dist[ch[a][0]] < dist[ch[a][1]]) swap(ch[a][0], ch[a][1]);
    dist[a] = dist[ch[a][1]]+1;
    return a;
}