算是比较水的题吧,不过由于结点数比较大需要利用vector去建图,不然的话会爆栈。
14001114 | 12186 | Another Crisis | Accepted | C++ | 0.212 | 2014-08-07 02:21:39 |
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<vector>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<list>
#include<string>
#include<sstream>
#include<ctime>
using namespace std;
#define _PI acos(-1.0)
#define INF 1 << 10
#define esp 1e-6
typedef long long LL;
typedef unsigned long long ULL;
typedef pair<int,int> pill;
/*===========================================
===========================================*/
#define MAXD 100000 + 10
vector<int>Node[MAXD];
int n,T;
int dp[MAXD];
void init(){
for(int i = 0 ; i <= n ; i++)
Node[i].clear();
}
bool Input(){
scanf("%d%d",&n,&T);
if(!n && !T)
return false;
init();
for(int i = 1 ; i <= n ; i++){
int x;
scanf("%d",&x);
Node[x].push_back(i);
}
return true;
}
int DP(int pos){
if(Node[pos].empty())
return 1;
int ans = 0;
vector<int>arr;
for(int i = 0 ; i < Node[pos].size() ; i++){
int son = Node[pos][i];
int t = DP(son);
arr.push_back(t);
}
sort(arr.begin(),arr.end());
double p = 1.0 * T / 100 * Node[pos].size();
int k;
if(p == (int)p)
k =(int)p;
else
k = (int)p + 1;
for(int i = 0 ; i < k ; i++){
ans += arr[i];
}
return ans;
}
int main(){
while(Input()){
int ans = DP(0);
printf("%d\n",ans);
}
return 0;
}