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

#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;

const int MAXN = 200100,logn = 17;

int n,q;
vector<int> edge[MAXN];
int rt,fa[MAXN];
int dep[MAXN],siz[MAXN],son[MAXN];
int top[MAXN],id[MAXN],last[MAXN],cnt;
int ti[MAXN];

struct Query{
    int t,x,y,c;
}Q[MAXN*2];int qcnt;

void init(){
    scanf("%d",&n);
    int p;
    for(int i = 1;i<=n;i++){
        scanf("%d",&p);
        if(p != 0){
            edge[p].push_back(i);
            fa[i] = p;
        }
        else{
            rt = i;
        }
    }
    scanf("%d",&q);
    for(int i = 1;i<=q;i++){
        int op,x,y,c;
        scanf("%d",&op);
        if(op == 1){
            scanf("%d %d %d",&x,&y,&c);
            Q[++qcnt] = (Query){i,x,y,c};
        }
        else{
            scanf("%d",&x);
            ti[x] = i;
        }
    }
}

void dfs1(int nown,int depth){
    siz[nown] = 1,dep[nown] = depth;
    for(unsigned i = 0;i<edge[nown].size();i++){
        int v = edge[nown][i];
        dfs1(v,depth+1);
        siz[nown] += siz[v]; 
        if(siz[v] > siz[son[nown]])
            son[nown] = v;
    }
}

void dfs2(int nown,int topf){
    top[nown] = topf;id[nown] = ++cnt;
    last[cnt] = nown;
    if(!son[nown]) return;
    dfs2(son[nown],topf);
    for(unsigned i = 0;i<edge[nown].size();i++){
        int v = edge[nown][i];
        if(v == son[nown]) continue;
        dfs2(v,v);
    }
}

namespace prSegTree{
    int ls[MAXN*logn],rs[MAXN*logn],sumn[MAXN*logn],cnt;
    #define mid ((l+r)>>1)
    void insert(int &nown,int pre,int l,int r,int pos,int val){
        nown = ++cnt;ls[nown] = ls[pre],rs[nown] = rs[pre],sumn[nown] = sumn[pre];
        if(l == r){
            sumn[nown] += val;
        }
        else{
            if(pos <= mid)
                insert(ls[nown],ls[pre],l,mid,pos,val);
            if(pos >= mid+1)
                insert(rs[nown],rs[pre],mid+1,r,pos,val);
            sumn[nown] = sumn[ls[nown]] + sumn[rs[nown]];
        }
    }
    int query(int nown,int l,int r,int ql,int qr){
    	if(ql > qr) return 0;
        if(ql <= l && r <= qr){
            return sumn[nown];
        }
        else{
            int ans = 0;
            if(ql <= mid){
                ans += query(ls[nown],l,mid,ql,qr);
            }
            if(qr >= mid+1){
                ans += query(rs[nown],mid+1,r,ql,qr);
            }
            return ans;
        }
    }
}

int root[MAXN];

int query_tree(int l,int r,int c){
    return prSegTree::query(root[r],1,q+1,1,c) - prSegTree::query(root[l-1],1,q+1,1,c);
}

void build(){
    dfs1(rt,1);
    dfs2(rt,rt);

    for(int i = 1;i<=n;i++){
    	if(ti[last[i]])
        	prSegTree::insert(root[i],root[i-1],1,q+1,ti[last[i]]+1,1);
        else
        	root[i] = root[i-1];
    }
}

void query(int x,int y,int c,int &tot,int &ans){
    ans = 0;tot = 0;
    while(top[x] != top[y]){
        if(dep[top[x]] < dep[top[y]]) swap(x,y);
        tot += dep[x] - dep[top[x]] + 1;
        ans += query_tree(id[top[x]],id[x],c);
        x = fa[top[x]]; 
    }
    if(dep[x] > dep[y]) swap(x,y);
    tot += dep[y] - dep[x] + 1;
    ans += query_tree(id[x],id[y],c);
}

void solve(){
    int ans = 0,tot = 0;
    for(int i = 1;i<=qcnt;i++){
        Query & qq = Q[i];
        query(qq.x,qq.y,qq.t-qq.c,tot,ans);
        printf("%d %d\n",tot,ans);
    }
}

int main(){
    init();
    build();
    solve();
    return 0;
}