Pat1090 코드

제목 설명:
A supply chain is a network of retailers(소매상), distributors(딜러), and suppliers(공급자) - everyone involved in moving a product from supplier to customer.
Starting from one root supplier, everyone on the chain buys products from one's supplier in a price P and sell or distribute them in a price that is r% higher than P. It is assumed that each member in the supply chain has exactly one supplier except the root supplier, and there is no supply cycle.
Now given a supply chain, you are supposed to tell the highest price we can expect from some retailers.
Input Specification:
Each input file contains one test case. For each case, The first line contains three positive numbers: N (<=105), the total number of the members in the supply chain (and hence they are numbered from 0 to N-1); P, the price given by the root supplier; and r, the percentage rate of price increment for each distributor or retailer. Then the next line contains N numbers, each number Si is the index of the supplier for the i-th member. Sroot for the root supplier is defined to be -1. All the numbers in a line are separated by a space.
Output Specification:
For each test case, print in one line the highest price we can expect from some retailers, accurate up to 2 decimal places, and the number of retailers that sell at the highest price. There must be one space between the two numbers. It is guaranteed that the price will not exceed 1010.
Sample Input:
9 1.80 1.00
1 5 4 4 -1 4 5 3 6
Sample Output:
1.85 2
AC 코드:
사실은 나무의 높이와 이 높이의 잎 노드의 수를 구하고 BFS를 직접 하면 된다.

#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<vector>
#include<deque>
#define MAXN 100005

using namespace std;

int n;
int root;
double p,r;
int visited[MAXN];
vector<int> v[MAXN];
deque<int> q;

void BFS(int root,int *height,int count[]){
	int endNode;
	int maxlevel=-1;
	q.push_back(root);
	visited[root]=1;
	endNode=q.back();
	while(!q.empty()){
		int index=q.front();
		q.pop_front();
		for(int i=0;i<v[index].size();i++){
			int j=v[index][i];
			if(!visited[j]){
				visited[j]=1;
				q.push_back(j);
			}
		}
		if(index==endNode){
			(*height)++;//height of the tree
			count[*height]=q.size();//reserve the nodes of each level
			endNode=q.back();
		}
	}
}

int main(int argc,char *argv[]){
	int height=0,count[MAXN];
	count[0]=1;
	scanf("%d %lf %lf",&n,&p,&r);
	for(int i=0;i<n;i++){
		int index;
		scanf("%d",&index);
		if(index==-1){
			root=i;
		}else{
			v[index].push_back(i);
		}
	}
	BFS(root,&height,count);
	printf("%.2lf %d
",p*pow((1+r/100.0),height-1),count[height-1]);
	return 0;
}