uva 12186 Another Crisis 树形DP

#include<cstring>
#include<string>
#include<cstdio>
#include<cstdlib>
#include<iostream>
#include<sstream>
#include<cmath>
#include<algorithm>
#include<queue>
#include<vector>
#include<map>
#include<stack>
#include<climits>
#include<cctype>
#include<bitset>
#include<set>
using namespace std;
#define mod 1000000007
#define PI acos(-1.0)
#define INF 0x3f3f3f3f
typedef long long LL;

const int MAXN=100005;
vector<int>son[MAXN];
int n,T;
int t;
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.push_back(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();
for(int i=1;i<=n;i++){
scanf("%d",&t);
son[t].push_back(i);
}
cout<<dp(0)<<endl;
}
return 0;
}