1090. Highest Price in Supply Chain (25)
来源:互联网 发布:c语言怎么解析 编辑:程序博客网 时间:2024/05/22 04:57
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.001 5 4 4 -1 4 5 3 6Sample Output:
1.85 2
好好背模板
#include<stdio.h>#include<math.h>#include<vector>using namespace std;int n;double p,r;struct node{int all;vector<int>child;}stu[100000];vector<int>ans;int deepest=-1;void dfs(int index,int depth){if(stu[index].child.size()==0){if(depth>deepest){deepest=depth;ans.clear();ans.push_back(index);}else if(depth==deepest){ans.push_back(index);}return;}int i;for(i=0;i<stu[index].child.size();i++){dfs(stu[index].child[i],depth+1);}}int main(){int i,father,root;scanf("%d %lf %lf",&n,&p,&r);for(i=0;i<n;i++){scanf("%d",&father);if(father!=-1){stu[father].child.push_back(i);}else{root=i;} }dfs(root,0);printf("%.2lf %d",p*pow(1+r/100,deepest),ans.size());}
- 1090. Highest Price in Supply Chain (25)
- 1090. Highest Price in Supply Chain (25)
- 1090. Highest Price in Supply Chain (25)
- 1090. Highest Price in Supply Chain (25)
- 1090. Highest Price in Supply Chain (25)
- 1090. Highest Price in Supply Chain (25)
- 1090. Highest Price in Supply Chain (25)
- 1090. Highest Price in Supply Chain (25)
- 1090. Highest Price in Supply Chain (25)
- 1090. Highest Price in Supply Chain (25)
- 1090. Highest Price in Supply Chain (25)
- 1090. Highest Price in Supply Chain (25)
- 1090. Highest Price in Supply Chain (25)
- 1090. Highest Price in Supply Chain (25)
- 1090. Highest Price in Supply Chain (25)
- 1090. Highest Price in Supply Chain (25)
- 1090. Highest Price in Supply Chain (25)
- 1090. Highest Price in Supply Chain (25)
- h5
- 解析js中的原型链和在原型链中对象属性查找
- 友盟第三方QQ简版快速上手步骤
- Java数组和字符串的长度计算
- 安装jupyter,一款python的web编辑器
- 1090. Highest Price in Supply Chain (25)
- CSS并不简单--带你认识不一样的渐变
- java:volatile关键字解析
- c++封装系统time函数,方便实现运行时间的打印
- linux之如何快速查看电脑内存大小
- DAO
- 剑指offer-62.二叉搜索树的第k个结点
- java 伪随机数安全性
- CUDA动态库封装以及调用