PAT_1079. Total Sales of Supply Chain

最新推荐文章于 2021-09-03 19:59:35 发布

kukubao207

最新推荐文章于 2021-09-03 19:59:35 发布

阅读量218

点赞数

分类专栏：算法题

本文链接：https://blog.csdn.net/kukubao207/article/details/77451594

版权

算法题专栏收录该内容

88 篇文章 0 订阅

订阅专栏

#include <iostream>
#include <vector>
using namespace std;
struct Tree 
{
	double weight;
	vector<int> child;
}t[100005];
int N;
double P,r,sum=0;
void dfs(int v,double price)
{
	if(t[v].weight!=-1)
	{
		sum+=t[v].weight*price;
		return;
	}
	for(int i=0;i<t[v].child.size();i++)
	{
		dfs(t[v].child[i],price*(1+r/100));
	}
}
int main()
{
	scanf("%d%lf%lf",&N,&P,&r);
	int tempnum;
	double weight;
	for(int i=0;i<N;i++)
	{
		scanf("%d",&tempnum);
		if(tempnum==0)
		{
			scanf("%lf",&weight);
			t[i].weight=weight;
		}
		else
		{
			int childid;
			for(int j=0;j<tempnum;j++)
			{
				scanf("%d",&childid);
				t[i].child.push_back(childid);
			}
			t[i].weight=-1;
		}
	}
	dfs(0,P);
	printf("%.1lf",sum);
	return 0;
}

树的dfs，较为简单的题目