UVA12186 Another Crisis

#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define se second
#define fs first
#define ll long long
#define CLR(x) memset(x,0,sizeof x)
#define MC(x,y) memcpy(x,y,sizeof(x))  
#define SZ(x) ((int)(x).size())
#define FOR(it,c) for(__typeof((c).begin()) it=(c).begin();it!=(c).end();it++)
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1 
#define INF 1e9
typedef pair<int,int> P;
const double eps=1e-9;
const int maxnnode=11000;
const int maxn=1e5+10;
const ll mod=1000000007;

int n,t;
int d[maxn];
vector<int> son[maxn];

int dp(int u)
{
	if(son[u].empty()) return 1;
	int k=son[u].size();
	vector<int> d;
	for(int i=0;i<k;i++) d.pb(dp(son[u][i]));
	sort(d.begin(),d.end());
	int c=(k*t-1)/100+1;
	int ans=0;
	for(int i=0;i<c;i++) ans+=d[i];
	return ans;
}


int main()
{
	while(scanf("%d%d",&n,&t)&&n&&t){
		for(int i=0;i<=n;i++) son[i].clear();
		int a;
		for(int i=1;i<=n;i++){
			scanf("%d",&a);
			son[a].pb(i);
		}
		printf("%d\n",dp(0));
	}
	return 0;
}