题目：https://pintia.cn/problem-sets/994805342720868352/problems/994805388447170560

注意点

这道题p、t的类型必须设置成double不然会有4个测试点错误

代码

  1. #include<vector>
  2. #include<algorithm>
  3. #include<iostream>
  4. #include<cmath>
  5. using namespace std;
  7. const int maxn = 100010;
  8. int n;
  9. double p, t, sum = 0;
  11. struct Node{
  12.     float amount;
  13.     vector<int> child;
  14. }node[maxn];
  16. void DFS(int root, int count){
  17.     if(node[root].child.size() == 0){
  18.         sum += p * node[root].amount * pow(1 + t, count);
  19.         return;
  20.     }
  21.     for(int i = 0; i < node[root].child.size(); i++){
  22.         DFS(node[root].child[i], count + 1);
  23.     }
  24. }
  26. int main(){
  27.     //n是成员人数，p是基本价格，t是每层中间商的多收价格
  28.     int child_num, child_temp, amount_temp;
  29.     scanf("%d%lf%lf", &n, &p, &t);
  30.     t /= 100;
  31.     for(int i = 0; i < n; i++){
  32.         scanf("%d", &child_num);
  33.         if(child_num != 0){
  34.             for(int j = 0; j < child_num; j++){
  35.                 scanf("%d", &child_temp);
  36.                 node[i].child.push_back(child_temp);
  37.                 node[i].amount = 0;
  38.             }
  39.         } else {
  40.             scanf("%f", &node[i].amount);
  41.         }
  42.     }
  43.     DFS(0, 0);
  44.     printf("%.1f", sum);
  45.     return 0;
  46. }