loj 2011

对于第 $i$ 天的询问
前 $i - c - 1$ 天都会影响答案
主席树维护

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <string>

using namespace std;

#define int long long

#define LL long long

#define gc getchar()
inline int read() {int x = ; char c = gc; while(c < '' || c > '') c = gc;
while(c >= '' && c <= '') x = x *  + c - '', c = gc; return x;}
inline LL read_LL() {LL x = ; char c = gc; while(c < '' || c > '') c = gc;
while(c >= '' && c <= '') x = x *  + c - '', c = gc; return x;}
#undef gc

const int N = 2e5 + ;

int Root[N], Lson[N * ], Rson[N * ], W[N * ];
struct Node {int v, nxt;} G[N];
int head[N], cnt;
int n, q, Rt;

int fa[N], deep[N], size[N], topp[N], son[N], tree[N], treejs;

inline void Link(int u, int v) {G[++ cnt].v = v; G[cnt].nxt = head[u]; head[u] = cnt;}

void Dfs_1(int u, int f_, int depth) {
    fa[u] = f_, deep[u] = depth, size[u] = ;
    for(int i = head[u]; ~ i; i = G[i].nxt) {
        int v = G[i].v;
        if(v == f_) continue;
        Dfs_1(v, u, depth + );
        size[u] += size[v];
        if(size[v] > size[son[u]]) son[u] = v;
    }
}

void Dfs_2(int u, int tp) {
    topp[u] = tp, tree[u] = ++ treejs;
    if(!son[u]) return ;
    Dfs_2(son[u], tp);
    for(int i = head[u]; ~ i; i = G[i].nxt) {
        int v = G[i].v;
        if(v != fa[u] && v != son[u]) Dfs_2(v, v);
    }
}

inline int Lca(int x, int y) {
    int tpx = topp[x], tpy = topp[y];
    while(tpx != tpy) {
        if(deep[tpx] < deep[tpy]) swap(x, y), swap(tpx, tpy);
        x = fa[tpx], tpx = topp[x];
    }
    return deep[x] < deep[y] ? x : y;
}

int Hjt;

void Fill(int x, int y) {
    Lson[x] = Lson[y], Rson[x] = Rson[y], W[x] = W[y];
}

#define lson jd << 1
#define rson jd << 1 | 1

void Sec_G(int &rt, int l, int r, int x) {
    Fill(++ Hjt, rt);
    rt = Hjt;
    W[rt] ++;
    if(l == r) return ;
    int mid = (l + r) >> ;
    if(x <= mid) Sec_G(Lson[rt], l, mid, x);
    else Sec_G(Rson[rt], mid + , r, x);
}

int Ans;

void Sec_A(int rt, int l, int r, int x, int y) {
    if(!rt) return ;
    if(x <= l && r <= y) {
        Ans += W[rt];
        return ;
    }
    int mid = (l + r) >> ;
    if(x <= mid) Sec_A(Lson[rt], l, mid, x, y);
    if(y > mid ) Sec_A(Rson[rt], mid + , r, x, y);
}

inline int Sec_A_imp(int rt, int x, int y) {
    if(rt <= ) return ;
    int ret = , tpx = topp[x], tpy = topp[y];
    while(tpx != tpy) {
        if(deep[tpx] < deep[tpy]) swap(x, y), swap(tpx, tpy);
        Ans = ;
        Sec_A(Root[rt], , n, tree[tpx], tree[x]);
        ret += Ans;
        x = fa[tpx], tpx = topp[x];
    }
    if(deep[x] < deep[y]) swap(x, y);
    Ans = ;
    Sec_A(Root[rt], , n, tree[y], tree[x]);
    ret += Ans;
    return ret;
}

main() {
    n = read();
    for(int i = ; i <= n; i ++) head[i] = -;
    for(int i = ; i <= n; i ++) {
        int v = read();
        if(!v) Rt = i;
        else Link(v, i);
    }
    Dfs_1(Rt, , );
    Dfs_2(Rt, Rt);
    q = read();
    for(int i = ; i <= q; i ++) {
        int opt = read();
        Root[i] = Root[i - ];
        if(opt == ) {
            int x = read(), y = read(), C = read();
            int a = deep[x] + deep[y] -  * deep[Lca(x, y)] + ;
            int b = Sec_A_imp(i - C - , x, y);
            cout << a << " " << b << "\n";
        } else {
            int x = read();
            Sec_G(Root[i], , n, tree[x]);
        }
    }
    return ;
}