PAT 甲级 1079 Total Sales of Supply Chain (25 分)

Note

• 树的遍历 – DFS
• ans类型用double！！！
• 注意第二层for循环中i与j是否同名！！！
• 简单题，注意细节！！！(太菜了orz)

Code

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

int n;
double ans=0;
double p,r;
struct Node{
	vector<int> child;
	int amount;
	double price;
}nod[100005];

void dfs(int root){
	if(nod[root].child.empty()){
		ans=ans+nod[root].price*nod[root].amount;
		return ;
	}
	for(int i=0;i<nod[root].child.size();i++){
		nod[nod[root].child[i]].price=nod[root].price*(1+r);
		dfs(nod[root].child[i]);
	}
}

int main(){
	#ifndef ONLINE_JUDGE
	freopen("data.txt","r",stdin);
	#endif

	scanf("%d %lf %lf",&n,&p,&r);
	r=r/100.0;
	int k,num;
	nod[0].price=p;
	for(int i=0;i<n;i++){
		scanf("%d",&k);
		if(k==0){
			scanf("%d",&num);
			nod[i].amount=num;
		}
		else{
			for(int j=0;j<k;j++){
				scanf("%d",&num);
				nod[i].child.push_back(num);
			}
		}
	}
	
	dfs(0);
	printf("%.1lf",ans);
	
	return 0;
}