PAT 1079

#include<cstdio>#include<cstring>#include<algorithm>#include<iostream>#include<vector>#include<queue>#include<stack>#include<cmath>using namespace std;const int maxn=100010;struct Node{int weight;vector<int>child;}node[maxn];int n;double p,r;double ans=0;void dfs(int index,int depth){if(node[index].child.size()==0){ans=ans+p*node[index].weight*pow(1+r/100,depth);return;}for(int i=0;i<node[index].child.size();i++){dfs(node[index].child[i],depth+1);}}int main(){scanf("%d%lf%lf",&n,&p,&r);int k,child;for(int i=0;i<n;i++){scanf("%d",&k);if(k!=0){for(int j=0;j<k;j++){scanf("%d",&child);node[i].child.push_back(child);}}else {scanf("%d",&child);node[i].weight=child;}}dfs(0,0);printf("%.1lf",ans);system("pause");return 0;}