1079. Total Sales of Supply Chain (25)
来源:互联网 发布:windows怎么禁止ping 编辑:程序博客网 时间:2024/06/04 01:14
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 total sales from all the 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 unit 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, then instead the total amount of the product will be given after Kj. All the numbers in a line are separated by a space.
Output Specification:
For each test case, print in one line the total sales we can expect from all the retailers, accurate up to 1 decimal place. It is guaranteed that the number will not exceed 1010.
Sample Input:
10 1.80 1.00
3 2 3 5
1 9
1 4
1 7
0 7
2 6 1
1 8
0 9
0 4
0 3
Sample Output:
42.4
思路一样的套路,和pat1004,pat1053,pat1094一样的思路
#include <iostream>#include <vector>using namespace std; const int maxn = 1e5 + 5;int n;double p, r, sum;vector<int> node[maxn];int sale[maxn];void dfs(int root, double s){ if(node[root].empty()){ sum += s * (double)sale[root]; return ; } for(int i = 0; i < node[root].size(); ++i) dfs(node[root][i], s * (1 + r / 100)); }int main(){ int k, child; scanf("%d%lf%lf", &n, &p, &r); for(int i = 0; i < n; ++i){ scanf("%d", &k); if(k != 0){ for(int j = 0; j < k; ++j){ scanf("%d", &child); node[i].push_back(child); } } else { scanf("%d", &child); sale[i] = child; } } dfs(0, p); printf("%.1lf", sum); return 0;}
- 1079. Total Sales of Supply Chain (25)
- 1079. Total Sales of Supply Chain (25)
- 1079. Total Sales of Supply Chain (25)
- 1079. Total Sales of Supply Chain (25)
- 1079. Total Sales of Supply Chain (25)
- 1079. Total Sales of Supply Chain (25)
- 1079. Total Sales of Supply Chain (25)
- 1079. Total Sales of Supply Chain (25)
- 1079. Total Sales of Supply Chain (25)
- 1079. Total Sales of Supply Chain (25)
- 1079. Total Sales of Supply Chain (25)
- 1079. Total Sales of Supply Chain (25)
- 1079. Total Sales of Supply Chain (25)
- 1079. Total Sales of Supply Chain (25)
- 1079. Total Sales of Supply Chain (25)
- 1079. Total Sales of Supply Chain (25)
- 1079. Total Sales of Supply Chain (25)
- 1079. Total Sales of Supply Chain (25)
- caffe将用训练好的caffemodel和train_val.prototxt文件分类新的一张图片-下篇--caffe学习(7)
- 基因算法解析、设计,以解决背包问题和旅行商问题为例
- 论文阅读(一)
- App测试中ios和Android的区别
- 函数参数的传值方式
- 1079. Total Sales of Supply Chain (25)
- HDU 2570 迷瘴 贪心
- 作业
- oracle 存储过程中 动态游标
- IRP
- Android日志工具——Logger
- BLE-NRF51822教程3-sdk程序框架剖析
- Xmanager 5 远程连接linux图形界面
- JSP:Multiple annotations found at this line 解决