PAT-1079-树的遍历

1079 Total Sales of Supply Chain
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[Ki]

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. Kj being 0 means that the j-tmember 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 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

谷歌中文翻译：
供应链是零售商（零售商），分销商（经销商）和供应商（供应商）的网络，每个人都参与将产品从供应商转移到客户的过程。

从一个根供应商开始，连锁店中的每个人都以价格P从一个供应商那里购买产品，并以比P高出r％的价格出售或分发产品。只有零售商才能面对顾客。假设供应链中的每个成员除根供应商外都只有一个供应商，并且没有供应周期。

现在，有了供应链，您应该说出所有零售商的总销售额。

输入规格：
每个输入文件包含一个测试用例。对于每种情况，第一行包含三个正数：N（≤10的5次），供应链中成员的总数（因此其ID的编号从0到N-1以及根供应商的编号ID为0）; P，根供应商给出的单价； r，每个分销商或零售商的价格上涨百分比。然后N行，每行以以下格式描述分销商或零售商：

K​i ID[1] ID[2] ... ID[Ki]

在第i行中，Ki是从供应商i接收产品的分销商或零售商的总数，然后是这些分销商或零售商的ID。 Kj为0表示j成员是零售商，则产品总数将在Kj之后给出。一行中的所有数字都用空格分隔。

输出规格：
对于每个测试用例，一行打印我们可以预期的所有零售商的总销售额，精确到小数点后一位。保证数量不会超过10的10次

简单题，但是要注意存储结点需要resize一下，不然输入就会出错。

#include<bits/stdc++.h>
using namespace std;

struct node {
	double data;
	vector<int> child;
}; 
 
vector<node> v;	//存放结点 
int n;			//结点总数，
double p, r;	//单价，增长百分比 
double ans = 0.0;

void init() {
	cin >> n >> p >> r;
	r = r / 100;	//将百分比转化为小数形式
	int k, c;
	//注意 重塑v的大小非常重要 
	v.resize(n);
	for(int i = 0; i < n; i++) {
		cin >> k;
		if(k == 0) {
			cin >> v[i].data;
		} else {
			for(int j = 0; j < k; j++) {
				cin >> c;
				v[i].child.push_back(c);
			}
		}
	} 	
}

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

int main() {
	init();
	dfs(0, 0);
	printf("%.1f", ans * p);
	return 0;
}