PAT日志 1079

顽强的小白

1079 Total Sales of Supply Chain （25 分）

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:
K​i​​ ID[1] ID[2] … ID[K​i​​]
where in the i-th line, K​i​​ 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. K​j​​ being 0 means that the j-th member is a retailer, then instead the total amount of the product will be given after K​j​​. 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

题目解析

树的题目，不是二叉树，从供货商到批发商再到零售商形成一个供货渠道，但是货物的价格每经过一个商家之手都要提升 t % 的价格，货物的数量在零售商手里。

这个输入中，第一个数字为0的就是零售商，后面跟的数字是货物数量。当然，零售商没有下家。题目中没有给出每个商家的下家可以有几个就设置为vector类型的容器，也好知道下家数量。

要求计算所有零售商货物价格总和，就需要遍历所有结点，找到树的叶节点，并且要记录叶结点所在层次，因此想到用递归，DFS，（实际上我也不知道自己写的是不是深度优先遍历DFS~）就这么乱来吧。

代码实现

struct{
 int product;
 vector<int> child;
}node[maxn];
int n;
double p,t;
double sum=0;
void DFS(int deep,int root){
 if(node[root].child.size()==0){
  sum+=p*node[root].product*pow(1+t/100.0,deep);
 // printf("%.1lf\n",p*node[root].product*(1+t/100.0,deep));
  return;
 }
 for(int i=0;i<node[root].child.size();++i){
  DFS(deep+1,node[root].child[i]);
 }
}
int main(){
 scanf("%d%lf%lf",&n,&p,&t);
 int k,child;
 for(int i=0;i<n;++i){
  scanf("%d",&k);
  if(k==0){
   scanf("%d",&node[i].product);
  }else{
   node[i].product=0;
   for(int j=0;j<k;++j){
    scanf("%d",&child);
    node[i].child.push_back(child);
   }
  }   
 }
 DFS(0,0);
 printf("%.1lf\n",sum);
 return 0;
}