A1090.cpp

#include <cstdio>
#include <cmath>
#include <vector>
using namespace std;

vector<int> child[maxn];//存放树
double p ,r ;
int n, maxDepth = 0, num = 0;

void DFS(int index, int depth){
	if(child[index].size() == 0){//到达叶节点
		if(depth > maxDepth){
			maxDepth = depth;
			num = -1;
		}
		else if(depth == maxDepth){
			num++;
		}
		return;
	}
	
	for(int i = 0; i < child[index].size(); i++){
		DFS(child[index][i], depth + 1);//递归访问结点index的子节点
	}
}

int main(){
	int father, root;
	scanf("%d %lf %lf", &n, &p, &r);
	r /= 100;
	for(int i = 0; i < n; i++){//输入树，并且找到根节点
		scanf("%d", &father);
		if(father != -1){
			child[father].push_back(i);
		}
		else{
			root = i;
		}
	}
	DFS(root, 0);
	printf("%.2f %d\n", p*pow(1+r, maxDepth), num);
	return 0;
}