PAT 1079 树的遍历_a supply chain is a network of resources and peopl-CSDN博客

本文链接：https://blog.csdn.net/qq_44910084/article/details/105959587

该博客讨论了PAT 1079题目的解决方案，涉及供应链中从供应商到零售商的价格传递。题目要求计算所有零售商的总销售额，通过树的遍历方法，特别是深度优先搜索（DFS）来解决。博主强调在计算总价格时避免过多浮点数运算，使用邻接表结构存储树，并结合节点权重。输入输出格式和样例也进行了说明。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

题目

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

本质上就是一个树的遍历找叶子层数的过程

代码和思路

使用DFS，虽然是针对叶子结点的层数，但是每个叶子节点有着不同的深度，所以用DFS更直观一些
在计算总价格的时候，可以先只记录总的倍数，也就是最后总价格的几倍，然后在最后乘一下单价，这样减少了浮点数的运算过程
因为节点是有权重的，使用邻接表的方式来存储数，并为每个节点建立一个权重值，构建一个结构体来进行处理
读入的时候要小心，如果第一个数字是0，则后面的数字是这个节点的权重weight
树的遍历不用考虑回环，所以不需要visit数组了

#include<cstdio>
#include<vector>
#include<math.h>
using namespace std;
const int maxn = 100010;

struct node {
	double weight;
	vector<int> child;
}Node[maxn];

double ans = 0, price;
double r;

void DFS(int index, int depth) {
	if (Node[index].child.size() == 0) {
		ans += Node[index].weight * pow(1 + r, depth);
		return;
	}
	for (int i = 0; i < Node[index].child.size(); i++) {
		DFS(Node[index].child[i], depth + 1);
	}
	return;
}

int main() {
	int n;
	int key, child;
	scanf("%d %lf %lf", &n, &price, &r);
	r /= 100;
	for (int i = 0; i < n; i++) {
		scanf("%d", &key);
		if (key == 0) {
			scanf("%lf", &Node[i].weight);
		}
		else {
			for (int j = 0; j < key; j++) {
				scanf("%d", &child);
				Node[i].child.push_back(child);
			}
		}
	}
	DFS(0, 0);
	printf("%.1f", price * ans);
	return 0;
}