精选文章 1079 Total Sales of Supply Chain (25 分) 树的遍历:DFS+vector

1079 Total Sales of Supply Chain (25 分) 树的遍历:DFS+vector

作者:ZXX_1999 时间: 2019-11-15 07:19:33
ZXX_1999 2019-11-15 07:19:33

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
#include 
#include 
#include 
#include 
using namespace std;
const int maxn = 100010;
struct node {
	double data;
	vector child;
}Node[maxn];

int n;
double p, r, ans=0;

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

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

 

相关文章

勿删,copyright占位
分享文章到微博
分享文章到朋友圈

上一篇:js回调函数配合ajax

下一篇:第六章 初始MyBatis

您可能感兴趣

华为云40多款云服务产品0元试用活动

免费套餐,马上领取!
CSDN

CSDN

中国开发者社区CSDN (Chinese Software Developer Network) 创立于1999年,致力为中国开发者提供知识传播、在线学习、职业发展等全生命周期服务。