PAT 甲级 刷题日记|A 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 (≤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
结尾无空行

思路

一般树的建立和遍历，与1090 1106题目背景都非常相似 dfs比bfs代码简洁多了

代码

#include 
using namespace std;

int n;
double p, r;
const int maxn = 100003;
double ans;
struct node {
    vector child;
    int scale;
    int height;
}Node[maxn];


void dfs(int root, int height) {
    if (Node[root].child.size() == 0) {
        ans += pow(1 + 0.01 * r, height) * p *Node[root].scale;
        return;
    }
    for (int i = 0; i < Node[root].child.size(); i++) {
        dfs(Node[root].child[i], height + 1);
    }
}

int main() {
    cin>>n>>p>>r;
    for (int i = 0; i < n; i++) {
        int num;
        cin>>num;
        if (num == 0) {
            cin>>Node[i].scale;
        } else {
            for (int j = 0; j < num; j++) {
                int ber;
                cin>>ber;
                Node[i].child.push_back(ber);
            }
        }
    }
    Node[0].height = 0;
    dfs(0, 0);
    printf("%.1f\n", ans);
     
}