PAT A1079 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​​.

• 大意：
  供应商给出商品底价，每层经销商会将价格提高百分之R，求零售商销售商品的总额
• 解题思路
  供应商可以类比为树的根节点，经销商可以类比为中间层次的节点，零售商可以类比为叶子节点，这就转化为叶子节点的层次问题了。这就只用采用树的先序遍历即可，只用多加一个层次变量level即可。

一开始太想套树的递归先序遍历，一直在纠结递归返回条件（空节点怎样判断），我采用的是将叶子节点下面再接一个达不到的子节点。实现如下：

#include <cstdio>
#include <vector>
#include <cmath>
using namespace std;
const int MAX = 100010;
double p, r, sum = 0.0;                //基本金额和增长率
struct Node{
    vector<int> child;
    double amount;                   //若为叶子节点则输入销售额
}node[MAX];
void DFS(double level, int index){
    if(index == 100011)
        return;                         //如果为空节点则返回
    else{
        if(node[index].child[0] == 100011){   //如果为叶子节点
            sum += p * node[index].amount * pow(1 + r/100, level)；
        }
        for(int i = 0; i < node[index].child.size(); i++){
            DFS(level + 1, node[index].child[i]);
        }
    }
}
int main()
{
    //输入N, P,R,
    int N;
    scanf("%d%lf%lf", &N, &p, &r);
    int temp;
     //输入树的信息
    for(int i = 0; i < N; i++){
        scanf("%d", &temp);
        int temp1;
        for(int j = 0; j < temp; j++){
            scanf("%d", &temp1);
            node[i].child.push_back(temp1);    //输入孩子节点
        }
        if(temp == 0){                       //如果为叶子节点
            double amount;
            scanf("%lf", &amount);
            node[i].amount = amount;
            node[i].child.push_back(100011);         //其子节点为空
        }
    }
    DFS(0, 0);
    printf("%.1f", sum);
    return 0;
}

后来看了《算法笔记》上的解法，只用将叶子节点作为递归返回条件即可！！代码实现：

#include <cstdio>
#include <vector>
#include <cmath>
using namespace std;
const int MAX = 100010;
double p, r, sum = 0.0;                //基本金额和增长率
struct Node{
    vector<int> child;
    double amount;                   //若为叶子节点则输入销售额
}node[MAX];
void DFS(double level, int index){
        if(node[index].child.size() == 0){   //如果为叶子节点
            sum += p * node[index].amount * pow(1 + r/100, level);
            return;
        }
        for(int i = 0; i < node[index].child.size(); i++){
            DFS(level + 1, node[index].child[i]);
        }
}
int main()
{
    //输入N, P,R,
    int N;
    scanf("%d%lf%lf", &N, &p, &r);
    int temp;
     //输入树的信息
    for(int i = 0; i < N; i++){
        scanf("%d", &temp);
        int temp1;
        for(int j = 0; j < temp; j++){
            scanf("%d", &temp1);
            node[i].child.push_back(temp1);    //输入孩子节点
        }
        if(temp == 0){                       //如果为叶子节点
            double amount;
            scanf("%lf", &amount);
            node[i].amount = amount;
        }
    }
    DFS(0, 0);
    printf("%.1f", sum);
    return 0;
}