1106. Lowest Price in Supply Chain (25)
来源:互联网 发布:网络电视啥功能 编辑:程序博客网 时间:2024/06/06 19:30
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.00
3 2 3 5
1 9
1 4
1 7
0
2 6 1
1 8
0
0
0
Sample Output:
1.8362 2
和pat1090一个套路。
#include <iostream>#include <vector>using namespace std; const int maxn = 1e5 + 5;int n, cnt;double p, r, sum;vector<int> node[maxn];void dfs(int root, double s){ if(node[root].empty()){ if(s < sum){ sum = s; cnt = 1; } else if(s == sum) ++cnt; return ; } for(int i = 0; i < node[root].size(); ++i) dfs(node[root][i], s * (1 + r / 100)); }int main(){ int k, child; cnt = 1; sum = 0x7fffffff; scanf("%d%lf%lf", &n, &p, &r); for(int i = 0; i < n; ++i){ scanf("%d", &k); for(int j = 0; j < k; ++j){ scanf("%d", &child); node[i].push_back(child); } } dfs(0, p); printf("%.4lf %d", sum, cnt); return 0;}
- 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)
- 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)
- 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)
- windows上IIS实现https,配置ssl证书
- Android 不同手机的cpu架构不同导致的一系列第三方sdk调用出问题的解决办法
- 用硬件描述语言Verilog 设计一个抢答器
- IT 达人
- [JZOJ3809] 设备塔
- 1106. Lowest Price in Supply Chain (25)
- Winform DevExpress控件库(三) 使用NavBarControl控件定制导航栏
- Dictionary<>的用法
- sequence_loss_by_example(logits, targets, weights)
- Android的设计架构MVP,MVC
- Join操作基本:外连接、自然连接、内连接
- springmvc无法接收uploadify插件上传的数据
- 多线程之GCD,NSOperation和NSOperationQueue,NSThread
- iOS 条码及二维码扫描(从相册中读取条形码/二维码) 以及扫码遇到的问题