1079. Total Sales of Supply Chain (25)【树+搜索】——PAT (Advanced Level) Practise
来源:互联网 发布:黑马程序员学费优惠 编辑:程序博客网 时间:2024/06/07 01:03
题目信息
1079. Total Sales of Supply Chain (25)
时间限制250 ms
内存限制65536 kB
代码长度限制16000 B
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 (<=10^5), 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 10^10.
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
解题思路
建树,搜索
AC代码
#include <cstdio>#include <vector>#include <cmath>using namespace std;int a[100005];vector<int> level[100005];int n, tn, t;double p, r;double dfs(int root, int lv){ double s = 0; if (level[root].size() == 0){ s += a[root] * pow(1+r/100, lv) * p; } for (int i = 0; i < level[root].size(); ++i){ s += dfs(level[root][i], lv + 1); } return s;}int main(){ scanf("%d%lf%lf", &n, &p, &r); for (int i = 0; i < n; ++i){ scanf("%d", &tn); if (tn > 0){ while (tn--){ scanf("%d", &t); level[i].push_back(t); } }else{ scanf("%d", &t); a[i] = t; } } printf("%.1f\n", dfs(0, 0)); return 0;}
- 1079. Total Sales of Supply Chain (25)【树+搜索】——PAT (Advanced Level) Practise
- PAT Advanced Level 1079. Total Sales of Supply Chain (25)
- 【PAT】【Advanced Level】1079. Total Sales of Supply Chain (25)
- PAT (Advanced Level) Practise 1079Total Sales of Supply Chain (25)
- PAT (Advanced Level) Practise 1079 Total Sales of Supply Chain (25)
- PAT (Advanced) 1079. Total Sales of Supply Chain (25)
- PAT (Advanced Level) 1079. Total Sales of Supply Chain (25) 总叠加售价 BFS
- Pat(Advanced Level)Practice--1079(Total Sales of Supply Chain)
- 【PAT】1079. Total Sales of Supply Chain
- PAT--1079. Total Sales of Supply Chain
- PAT 1079. Total Sales of Supply Chain (25)
- PAT A 1079. Total Sales of Supply Chain (25)
- PAT 1079. Total Sales of Supply Chain (25)
- PAT 1079. Total Sales of Supply Chain (25)
- PAT 1079. Total Sales of Supply Chain (25)
- 【PAT】1079. Total Sales of Supply Chain (25)
- 1079. Total Sales of Supply Chain (25)PAT甲级
- PAT甲级练习1079. Total Sales of Supply Chain (25)
- JOS Lab2 保护模式下的内存映射机制:段机制 页机制
- RxJava 入门
- 用jni实现ping
- NFC在Android中的应用
- Lucene初探
- 1079. Total Sales of Supply Chain (25)【树+搜索】——PAT (Advanced Level) Practise
- 离职风波(2)
- fir.im Weekly - 1000 Android 开源项目集合
- Apache 代理nodejs
- 蓝桥杯 查找整数
- 【FastDev4Android框架开发】AndroidAnnnotations注入框架使用之注入组件Components(九)
- android View 系统 touch 事件处理
- 1080. Graduate Admission (30)【排序】——PAT (Advanced Level) Practise
- [leetcode] Word Pattern