我这个贪心假在哪了（必关）

#include<bits/stdc++.h>
//因为爱，所以坚持
using namespace std;

int T,n,m,p[8050],ans[8050],sum,d[8050];
vector<int> es[8050];

bool ok(int x){
	for(int i = 0;i < es[x].size();++i){
		int v = es[x][i];
		if(es[v].size() != 0) return false;
	}
	return true;
}
void del(int x){
	ans[x] = 0;
	for(int i = 0;i < es[x].size();++i) del(es[x][i]);
}
inline int calc(int x){
	int res = ans[x];
	for(int i = 0;i < es[x].size();++i){
		res+=calc(es[x][i]);
	}
	return res;
}
void dfs(int u,int fa){
	d[u] = d[fa]+1;
	if(es[u].size() == 0) return ;
	if(ok(u)){
		ans[u] = es[u].size()+1;
		ans[es[u][0]] = 1;
		return ;
	}
	int mx = 0;
	for(int i = 0;i < es[u].size();++i){
		int v = es[u][i];
		dfs(v,u);
		if(es[v].size() == 0) ans[v] = 1;
		mx = max(mx,ans[v]);
	}
	bool flag = false;
	for(int i = 0;i < es[u].size();++i){
		int v = es[u][i];
		if(ans[v] == mx && flag == false){
			ans[u] += ans[v]+1;
			flag = true;
			continue;
		}
		if(d[u]*ans[v] <= calc(v)) continue;
		ans[u]+=ans[v];
		del(v);
	}
	if(ans[u] == 0) ans[u] = mx+1;
}

int main(){
	freopen("data.in","r",stdin);
	ios::sync_with_stdio(false);
	cin.tie(0);
	cin>>T;
	while(T--){
		for(int i = 1;i <= n;++i){
			es[i].clear();
			ans[i] = sum = 0;
		}
		cin>>n>>m;
		for(register int i = 2;i <= n;++i){
			cin>>p[i];
			es[p[i]].push_back(i);
		}
		dfs(1,0);
		for(int i = 1;i <= n;++i) sum+=ans[i];
		cout<<sum<<endl;
	}
	return 0;
}

1
18 17
1 2 2 4 4 3 3 3 3 10 5 7 7 9 8 10 5