2022.1.28 练习 PAT甲 1079 Total Sales of Supply Chain (原题链接)
题解如下:
#include <bits/stdc++.h>
using namespace std;
const int MAX_SIZE=100010;
int n;
double p,r;
struct node
{
int data;
vector<int> child;
}Node[MAX_SIZE];
double sum=0;
void DFS(int index,int high)
{
if(Node[index].child.size()==0)
{
sum+=Node[index].data*(p*pow(1+r,high));
}
for(unsigned int i=0;i<Node[index].child.size();i++)
{
DFS(Node[index].child[i],high+1);
}
}
int main()
{
std::ios::sync_with_stdio(false);
cin>>n>>p>>r;
r=r/100;
for(int i=0;i<n;i++)
{
int k;
cin>>k;
if(k>0)
{
for(int j=0;j<k;j++)
{
int tmp;
cin>>tmp;
Node[i].child.push_back(tmp);
}
}
else if(k==0)
{
int tmp;
cin>>tmp;
Node[i].data=tmp;
}
}
DFS(0,0);
cout<<setiosflags(ios::fixed)<<setprecision(1)<<sum;
return 0;
}