PAT甲级真题及训练集(22)--1090. Highest Price in Supply Chain (25)

1090. Highest Price in Supply Chain (25)

时间限制

200 ms

内存限制

65536 kB

代码长度限制

16000 B

判题程序

Standard

作者

CHEN, Yue

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 (<=10⁵), 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 S_i is the index of the supplier for the i-th member. S_root 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 10¹⁰.

Sample Input:

9 1.80 1.00
1 5 4 4 -1 4 5 3 6

Sample Output:

1.85 2

---

提交代码

/**
作者：一叶扁舟
时间：19:31 2017/7/8
思路：
	
计算最大深度的价格 

*/
#include <stdio.h>
#include <stdlib.h>
#include <algorithm>
#include <stack>
#include <queue>
#include <math.h>
#include <string.h>
#include <vector>
using namespace std;
#define SIZE 100001

//定义的树，可以用结构体，也可以用直接用vector<int> tree来定义
vector<int> tree[SIZE];
int maxDepth = 0;//最大深度
int num = 0;//最大深度相同的结点个数

void getDepth(int root,int depth){
	//到了叶子节点
	if (tree[root].size() == 0){
		if (depth > maxDepth){
			maxDepth = depth;
			num = 1;
		}
		else if (depth == maxDepth){
			num++;
		}
		return;
	}

	for (unsigned int i = 0; i < tree[root].size(); i++){
		//递归访问root的子结点
		getDepth(tree[root][i], depth + 1);
	}

}
int main(){
	//注意使用double，否则使用float，会存在精确度误差导致出错
	double r;//价格增加的比率
	int N;//树的结点个数
	double m;//基础提升价格
	int root;
	scanf("%d %lf %lf", &N, &m, &r);
	r = r / 100;//变成百分比
	for (int i = 0; i < N; i++){
		int temp;
		scanf("%d", &temp);
		if (temp == -1){
			root = i;
		}
		else{
		//父节点temp中放入对应的子结点
		tree[temp].push_back(i);
		}
	}
	int depth = 0;
	//获取深度
    getDepth(root, depth);
	//计算价格
	double result = 1.00;
	for (int i = 0; i < maxDepth; i++){
		result = result * (1 + r);
	}
	result = result * m;
	//printf("%.2lf %d",result , num);
	printf("%.2lf %d", m * pow(1 + r, maxDepth), num);

	system("pause");
	return 0;
}