思路:
直接暴力判断,用一个堆维护
c o d e code code
#include<iostream>
#include<cstdio>
#include<queue>
using namespace std;
int n, t, tot;
int a[100010], head[100010], siz[100010];
struct node
{
int to, next;
}b[100010];
inline void add(register int x, register int y)
{
b[++tot]=(node){y, head[x]};
head[x]=tot;
}
inline void dfs(register int x)
{
priority_queue<int> q;
siz[x]=1;
register int sum=0;
for(register int i=head[x]; i; i=b[i].next)
{
register int y=b[i].to;
dfs(y);
q.push(-siz[y]);
sum++;
}
register int js=sum*t/100;
if(sum*t%100!=0)
js++;
if(js)
siz[x]=0;
while(js--)
{
siz[x]+=-q.top();
q.pop();
}
}
int main()
{
// freopen("T2_jix.in", "r", stdin);
scanf("%d%d", &n, &t);
for(register int i=1; i<=n; i++)
{
scanf("%d", &a[i]);
add(a[i], i);
}
dfs(0);
printf("%d", siz[0]);
return 0;
}