PAT-A-1079. Total Sales of Supply Chain (25)
2017-05-22 22:51
253 查看
1079. Total Sales of Supply Chain (25)
时间限制250 ms
内存限制
65536 kB
代码长度限制
16000 B
判题程序
Standard
作者
CHEN, Yue
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
#include<iostream> #include<vector> #include<cstdio> #include<math.h> #include<stdio.h> using namespace std; const int maxn = 100010; double n, p, r; struct node{ int date; vector<int> child; }Node[maxn]; double ans = 0; void DFS(int root,int depth) { if (Node[root].child.size() == 0) { ans += p*Node[root].date*pow(1 + r, depth); return; } for (int i = 0; i < Node[root].child.size(); i++) { DFS(Node[root].child[i], depth + 1); } } int main() { cin >> n >> p >> r; int temp; int c; for (int i = 0; i < n; i++) { cin >> temp; if (temp == 0) { cin >> Node[i].date; } else { for (int j = 0; j < temp; j++) { cin >> c; Node[i].child.push_back(c); } } } r = r / 100; DFS(0, 0); printf("%.1f\n", ans); system("pause"); return 0; }
相关文章推荐
- 1035. 插入与归并(25)-浙大PAT乙级真题
- 1005. 继续(3n+1)猜想 (25) PAT乙级真题
- 1060. Are They Equal (25)-PAT
- 1093. Count PAT's (25)
- 1016. Phone Bills (25) @ PAT (Advanced Level) Practise
- PAT-Find Coins (25)
- PAT-A-1029. Median (25)
- 1048. Find Coins (25)-PAT
- PAT甲题题解-1043. Is It a Binary Search Tree (25)-二叉搜索树
- PAT 1030. 完美数列(25)
- 【PAT】1009. Product of Polynomials (25)
- PAT 1007. Maximum Subsequence Sum (25)
- 1044. Shopping in Mars (25)-PAT
- 【PAT】1025. PAT Ranking (25)
- PAT (Advanced Level) Practise 1062 Talent and Virtue (25)
- PAT-A-1039. Course List for Student (25)
- 1082. Read Number in Chinese (25)【字符串处理】——PAT (Advanced Level) Practise
- 1024. Palindromic Number (25) @ PAT (Advanced Level) Practise
- PAT (Advanced Level) Practise 1066 Root of AVL Tree (25)
- 1062. Talent and Virtue (25)-PAT