#include "september.h"
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
const int LG = 20;
int tot = 0, tmr = 0, inf[5], n;
map < int , int > mp;
int in[N], out[N], sub[N], up[N][LG];
int lzy[5][N * 4], lzy2[5][N * 4], st[5][N * 4], st2[5][N * 4], st3[5][N * 4];
vector < int > adj[N];
void dfs(int u, int p){
in[u] = ++tmr;
sub[u] = 1;
up[u][0] = p;
for(int i = 1; i < LG; i++)
up[u][i] = up[up[u][i - 1]][i - 1];
for(auto v : adj[u]){
dfs(v, u);
sub[u] += sub[v];
}
out[u] = tmr;
}
void relax(int id, int v, int l, int r){
if(lzy[id][v] == -1)return;
if(l != r){
lzy[id][v * 2] = lzy[id][v];
lzy[id][v * 2 + 1] = lzy[id][v];
}
st2[id][v] = (r - l + 1) * lzy[id][v];
lzy[id][v] = -1;
}
void upd(int id, int v, int l, int r, int pos){
if(l == r){
st[id][v] = 1;
return;
}
int mid = (l + r) >> 1;
if(mid >= pos)upd(id, v * 2, l, mid, pos);
else upd(id, v * 2 + 1, mid + 1, r, pos);
st[id][v] = st[id][v * 2] + st[id][v * 2 + 1];
}
int ask(int id, int v, int l, int r, int ql, int qr){
if(l > qr || r < ql)return 0;
if(l >= ql && r <= qr)return st[id][v];
int mid = (l + r) >> 1;
return ask(id, v * 2, l, mid, ql, qr) + ask(id, v * 2 + 1, mid + 1, r, ql, qr);
}
void upd2(int id, int v, int l, int r, int ul, int ur, int x){
relax(id, v, l, r);
if(l > ur || r < ul)return;
if(l >= ul && r <= ur){
lzy[id][v] = x;
relax(id, v, l, r);
return;
}
int mid = (l + r) >> 1;
upd2(id, v * 2, l, mid, ul, ur, x);
upd2(id, v * 2 + 1, mid + 1, r, ul, ur, x);
st2[id][v] = st2[id][v * 2] + st2[id][v * 2 + 1];
}
int ask2(int id, int v, int l, int r, int ql, int qr){
relax(id, v, l, r);
if(l > qr || r < ql)return 0;
if(l >= ql && r <= qr)return st2[id][v];
int mid = (l + r) >> 1;
return ask2(id, v * 2, l, mid, ql, qr) + ask2(id, v * 2 + 1, mid + 1, r, ql, qr);
}
void relax2(int id, int v, int l, int r){
if(lzy2[id][v] == -1)return;
if(l != r){
lzy2[id][v * 2] = lzy2[id][v];
lzy2[id][v * 2 + 1] = lzy2[id][v];
}
st3[id][v] = (r - l + 1) * lzy2[id][v];
lzy2[id][v] = -1;
}
void upd3(int id, int v, int l, int r, int ul, int ur){
relax2(id, v, l, r);
if(l > ur || r < ul)return;
if(l >= ul && r <= ur){
lzy2[id][v] = 1;
relax2(id, v, l, r);
return;
}
int mid = (l + r) >> 1;
upd3(id, v * 2, l, mid, ul, ur);
upd3(id, v * 2 + 1, mid + 1, r, ul, ur);
st3[id][v] = st3[id][v * 2] + st3[id][v * 2 + 1];
}
int ask3(int id, int v, int l, int r, int ql, int qr){
relax2(id, v, l, r);
if(l > qr || r < ql)return 0;
if(l >= ql && r <= qr)return st3[id][v];
int mid = (l + r) >> 1;
return ask3(id, v * 2, l, mid, ql, qr) + ask3(id, v * 2 + 1, mid + 1, r, ql, qr);
}
bool ok(int id, int node){
int anc = -1;
node = up[node][0];
if(node && ask3(id, 1, 1, n, in[node], in[node]) >= 1){
anc = node;
for(int i = LG - 1; i >= 0; i--){
int nxt = up[node][i];
if(nxt && ask3(id, 1, 1, n, in[nxt], in[nxt]) >= 1){
node = nxt;
anc = node;
}
}
}
if(anc == -1)return true;
int tot = ask(id, 1, 1, n, in[anc], out[anc]);
if(sub[anc] == tot){
inf[id] -= ask2(id, 1, 1, n, in[anc], out[anc]);
upd2(id, 1, 1, n, in[anc], out[anc], 0);
}
return (sub[anc] == tot);
}
int solve(int n_, int m, vector < int > F, vector < vector < int > > S){
n = n_, tmr = 0;
for(int j = 0; j < m; j++){
inf[j] = 0;
for(int i = 0; i <= n * 4; i++){
lzy[j][i] = lzy2[j][i] = -1;
st[j][i] = st2[j][i] = st3[j][i] = 0;
}
}
for(int i = 0; i <= n; i++){
adj[i].clear();
for(int j = 0; j < LG; j++)
up[i][j] = 0;
}
for (int i = 0; i < n - 1; i++) {
adj[F[i] + 1].push_back(i + 2);
}
for(int i = 0; i < m; i++){
for(int j = 0; j < S[i].size(); j++){
S[i][j]++;
}
}
dfs(1, 1);
int k = 0;
for(int i = 0; i < n - 1; i++){
bool f = true;
for(int j = 0; j < m; j++){
int node = S[j][i];
upd3(j, 1, 1, n, in[node], out[node]);
upd(j, 1, 1, n, in[node]);
bool is1 = (ask(j, 1, 1, n, in[node], out[node]) == sub[node]);
bool is2 = ok(j, node);
if(!is1 || !is2){
upd2(j, 1, 1, n, in[node], in[node], 1);
inf[j]++;
}
if(inf[j] != 0)f = false;
}
if(f)k++;
}
return k;
}
/*
6 1
0 0 1 3 1
5 3 1 2 4
*/
