pat 1106. Lowest Price in Supply Chain (25)
来源:互联网 发布:淘宝宝贝链接怎么发 编辑:程序博客网 时间:2024/05/16 10: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. Only the retailers will face the customers.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 lowest price a customer 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 their ID's are numbered from 0 to N-1, and the root supplier's ID is 0); P, the price given by the root supplier; and r, the percentage rate of price increment for each distributor or retailer. Then N lines follow, each describes a distributor or retailer in the following format:
Ki ID[1] ID[2] ... ID[Ki]
where in the i-th line, Ki is the total number of distributors or retailers who receive products from supplier i, and is then followed by the ID's of these distributors or retailers. Kj being 0 means that the j-th member is a retailer. All the numbers in a line are separated by a space.
Output Specification:
For each test case, print in one line the lowest price we can expect from some retailers, accurate up to 4 decimal places, and the number of retailers that sell at the lowest price. There must be one space between the two numbers. It is guaranteed that the all the prices will not exceed 1010.
Sample Input:10 1.80 1.003 2 3 51 91 41 702 6 11 8000Sample Output:
1.8362 2
最近做二叉树的题目做上瘾了。
关键点:建树,求出深度最浅的叶子结点的深度及其数目即可。
#include <iostream>#include<string.h>#include<stack>#include<vector>using namespace std;#include<stdio.h>#include<algorithm>#include<queue>vector<int>tree[150000];int n,mm,ans[150000];double p,r,t;void dfs(int u,int depth){ int i; if(tree[u].size()==0) { mm=min(mm,depth); ans[depth]++; return ; } for(i=0;i<tree[u].size();i++) { dfs(tree[u][i],depth+1); }}int main(){ int i,k,j,num; cin>>n>>p>>r; for(i=0;i<n;i++) { cin>>k; for(j=0;j<k;j++) { cin>>num; tree[i].push_back(num); } } mm=999999; dfs(0,1); t=1; for(i=1;i<mm;i++) t=t*(1+r*1.0/100); printf("%.4lf %d\n",t*p,ans[mm]); return 0;}
- PAT--1106. Lowest Price in Supply Chain
- 【PAT】1106. Lowest Price in Supply Chain
- 【PAT】1106. Lowest Price in Supply Chain (25)
- PAT 1106. Lowest Price in Supply Chain (25)
- pat 1106. Lowest Price in Supply Chain (25)
- PAT 1106. Lowest Price in Supply Chain (25)
- 1106. Lowest Price in Supply Chain (25) PAT甲级
- pat 1106. Lowest Price in Supply Chain (25)
- PAT A 1106. Lowest Price in Supply Chain (25)
- 【PAT】【Advanced Level】1106. Lowest Price in Supply Chain (25)
- Pat(A) 1106. Lowest Price in Supply Chain (25)
- PAT 甲级 1106. Lowest Price in Supply Chain (25)
- 1106. Lowest Price in Supply Chain (25)
- 1106. Lowest Price in Supply Chain (25)
- 1106. Lowest Price in Supply Chain (25)
- 1106. Lowest Price in Supply Chain (25)
- 1106. Lowest Price in Supply Chain (25)
- 1106. Lowest Price in Supply Chain (25)
- java-框架-AKKA
- 设计模式之单例、多例、工厂、值对象
- linux课堂笔记--shell5条件判断与流程控制
- 使用Spring提供的mail API来发送邮件
- R在统计学上的应用
- pat 1106. Lowest Price in Supply Chain (25)
- 3.2 设计一个程序,要求用户输入 5 个字符,然后将这 5 个字符按相反的顺序显示出 来。例如,假设输入 abcde,则输出为 edcba
- linux通过端口杀进程
- CSS3样式一
- POJ 3984 BFS走迷宫问题
- 习题19 函数和变量
- 关于FileReader无法找到文件原因
- git 使用场景一,pull报错:Auto Merge Failed; Fix Conflicts and Then Commit the Result.
- pat甲级_路径问题(例题:pat 1003 Emergency (25))