PAT A1079 Total Sales of Supply Chain (25 point(s))

题目

Code

#include
#include
#include
#include
using namespace std;
const int maxn=100100;
struct node{
double data;
vector child;
}Node[maxn];
int n;
double p,r,ans=0;
void DFS(int index,int depth){
if(Node[index].child.size()==0){// leaf 临界条件
ans+=Node[index].data*pow(1+r, depth);
return;
}
for(int i= 0; i<Node[index].child.size();i++){
DFS(Node[index].child[i], depth+1);
}
}

int main(){
int k,child;
scanf("%d%lf%lf",&n,&p,&r);
r/=100;
for(int i=0;i<n;i++){
scanf("%d",&k);
if(k==0){
scanf("%lf",&Node[i].data);
}else{
for(int j=0;j<k;j++){
scanf("%d",&child);
Node[i].child.push_back(child);
}
}

}
DFS(0,0);
printf("%.1f\n",p*ans);
return 0;

}