1079. Total Sales of Supply Chain 解析

还是老样子的供应商问题，这次是给出了零售商手里有多少手机，全部卖出能卖多少钱。

提前把转手n次后的价格算出来，不然容易超时。

开始以为层数不会太大。。结果还是接近10^5的....

……………………更新线…………………………

用float的同学需要吧float改成double才行。不是精度不够就是float爆了

#include <iostream>
#include <vector>
#include <queue>

#define MAX 100010

using namespace std;

struct Node{
	int amount;
	int level;
	vector <int> c;
	Node() { amount = 1; level = 0; }
};
Node t[MAX];

int n;
double p, r;
double sum = 0;
double pSerch[MAX];

vector <int> ThisAns;

void DFS(int u) {
	if (t[u].c.size() == 0) {
		
		double tp = pSerch[ThisAns.size()];
		/*for (int i = 0; i < ThisAns.size(); i++) {
			tp *= (1 + r / 100);
		}*/
		sum += (tp * t[u].amount);
		return;
	}

	ThisAns.push_back(u);
	for (int i = 0; i < t[u].c.size(); i++) {
		DFS(t[u].c[i]);
	}
	ThisAns.pop_back();	
}

void LevelOrder(int st) {
	queue <int> q;
	q.push(st);
	while (!q.empty()) {
		int top = q.front();
		q.pop();
		if (t[top].c.size() == 0) {
			sum += (pSerch[t[top].level] * t[top].amount);
		}
		else {
			for (int i = 0; i < t[top].c.size(); i++) {
				q.push(t[top].c[i]);
				t[t[top].c[i]].level = t[top].level + 1;
			}
		}
	}
}


int main() {
	cin >> n >> p >> r;

	r = 1 + r / 100;

	double tp = p;

	for (int i = 0; i < MAX; i++) {
		pSerch[i] = tp;
		tp *= r;
	}

	int cNum, cNo;
	for (int i = 0; i < n; i++) {
		scanf("%d", &cNum);
		if (cNum == 0) {
			scanf("%d", &t[i].amount);
		}
		else {
			for (int j = 0; j < cNum; j++) {
				scanf("%d", &cNo);
				t[i].c.push_back(cNo);
			}
		}
	}

	DFS(0);

	printf("%.01lf\n", sum);

	return 0;

}