# 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 (<=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

-1是根节点，其他的是位置的值，是其父亲节点的位置值。下标从0~N-1,求原值p乘以(1+0.01*r)^x的值，和最后一层的节点数。x为层深。

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <queue>
#include <vector>
using namespace std;
int ori[100010],depth[100010];
vector <int> v[100010];
queue <int> qe;
int main()
{
int n,cnt=1,pos,tmp,dep;
double p,r;
//读入
scanf("%d%lf%lf",&n,&p,&r);
for(int i=0;i<n;i++)
{
scanf("%d",&ori[i]);
if(ori[i]==-1)
pos=i;
}
//每个父亲节点记录其儿子节点
for(int i=0;i<n;i++)
{
v[ori[i]].push_back(i);
}
depth[pos]=1;
qe.push(pos);
//队列模拟遍历树
while(!qe.empty())
{
tmp=qe.front();
dep=depth[tmp]+1;
qe.pop();
for(int i=0;i<v[tmp].size();i++)
{
depth[v[tmp][i]]=dep;
qe.push(v[tmp][i]);
}
}
//排个序
sort(depth,depth+n);
dep=depth[n-1];
for(int i=n-2;i>=0;i--)
{
if(depth[i]==dep)
cnt++;
else break;
}
//求结果
for(int i=1;i<dep;i++)
p*=(1+0.01*r);
printf("%.2lf %d\n",p,cnt);
return 0;
} 

## PAT 1090. Highest Price in Supply Chain (25)（DFS）

PAT 1090. Highest Price in Supply Chain (25)（DFS）
• u012860063
• 2015年04月19日 20:29
• 881

## 1090. Highest Price in Supply Chain (25) -计层的BFS改进

• xyt8023y
• 2015年08月24日 18:24
• 740

## 1090. Highest Price in Supply Chain

A supply chain is a network of retailers（零售商）, distributors（经销商）, and suppliers（供应商）-- everyone invo...
• zzyafyj
• 2014年11月30日 15:31
• 1285

## PAT (Advanced Level) 1090. Highest Price in Supply Chain (25) 供应链，BFS

A supply chain is a network of retailers（零售商）, distributors（经销商）, and suppliers（供应商）-- everyone invo...
• tuzigg123
• 2015年07月31日 09:02
• 716

## PAT (Advanced Level) Practise 1090 Highest Price in Supply Chain (25)

1090. Highest Price in Supply Chain (25) 时间限制 200 ms 内存限制 65536 kB 代码...
• jtjy568805874
• 2016年03月25日 18:07
• 231

## 【PAT】【Advanced Level】1090. Highest Price in Supply Chain (25)

• u011777915
• 2017年09月04日 16:55
• 57

## PAT (Advanced Level) Practise 1106 Lowest Price in Supply Chain (25)

1106. Lowest Price in Supply Chain (25) 时间限制 200 ms 内存限制 65536 kB 代码长...
• jtjy568805874
• 2016年03月26日 15:48
• 359

## PAT (Advanced Level) Practise 1106 Lowest Price in Supply Chain(25)

1106. Lowest Price in Supply Chain (25) 时间限制 200 ms 内存限制 65536 kB 代码长度限制 16000 B 判...
• a664607530
• 2017年06月30日 13:33
• 91

## Highest Price in Supply Chain

• Wind_white
• 2017年03月07日 20:30
• 91

## PAT 1090. Highest Price in Supply Chain (25)

#include #include #include #include #include #include #include #include #include #include #include ...
• u012443276
• 2014年11月30日 16:10
• 238

举报原因： 您举报文章：PAT-PAT (Advanced Level) Practise Highest Price in Supply Chain(25) 【三星级】 色情 政治 抄袭 广告 招聘 骂人 其他 (最多只允许输入30个字)