PAT A1090 Highest Price in Supply Chain

#include<cstdio>
#include<algorithm>
#include<queue>
#include<vector>
#include<cmath>
using namespace std;
int n;
double p,r;
int root;
const int maxn = 100010;
struct node{
	int data;
	int level;
	vector<int> child;
}Node[maxn];

void BFS(int root){
	Node[root].level = 0;
	queue<int> q;
	q.push(root);
	while(!q.empty()){
		int newnode = q.front();
		q.pop();
		for(int i = 0; i < Node[newnode].child.size(); i++){
			int child = Node[newnode].child[i];
			Node[child].level = Node[newnode].level + 1;
			q.push(child);
		}
	}
}

int main(){
	int value;
	scanf("%d %lf %lf",&n,&p,&r);
	for(int i = 0;i < n;i++){
		scanf("%d",&value);
		if(value != -1) Node[value].child.push_back(i);
		else root = i;
	}
	BFS(root);
	int max_level = 0;
	for(int i=0;i<n;i++){
		if (Node[i].level > max_level) max_level = Node[i].level;
	}
	int num = 0;
	for(int i=0;i<n;i++){
		if (Node[i].level == max_level) num++;
	}
	printf("%.2f %d\n", p*pow((1+0.01*r) ,max_level),num);
}