PAT-A1090

#include<stdio.h>#include<vector>#include<queue>#include<math.h>using namespace std;int  n,  max_level=-1, sum=0;double p, r, ans=0;struct pnode{int level;vector<int> child;}node[100010];void levelorder(int root){node[root].level=0;queue<int> que;que.push(root);while(!que.empty()){int front=que.front();que.pop();if(node[front].level>max_level){max_level=node[front].level;sum=1;}else if(node[front].level=max_level){sum++;}for(vector<int>::iterator it=node[front].child.begin();it!=node[front].child.end();it++){node[*it].level=node[front].level+1;que.push(*it);}}//while}int main(){int i, temp, root;scanf("%d%lf%lf",&n,&p,&r);for(i=0;i<n;i++){    scanf("%d",&temp);if(temp==-1)root=i;else node[temp].child.push_back(i);}r=1+r/100;levelorder(root);printf("%0.2lf %d\n",p*pow(r,max_level),sum);return 0;}