题目：https://pintia.cn/problem-sets/994805342720868352/problems/994805362341822464
还是老套路，用了DFS把depth参数初始化了，就是calculate函数有几个参数写错了，搞得调试了几遍都没过。。也是服了自己了

代码

  1. #include<algorithm>
  2. #include<vector>
  3. #include<iostream>
  4. #include<cmath>
  5. using namespace std;
  7. const int maxn = 100010;
  8. struct Node{
  9.     int depth;
  10.     vector<int> child;
  11. }node[maxn];
  13. int hash_table[maxn] = {0};
  15. int n;
  16. double p, r;
  18. void DFS(int root, int depth){
  19.     if(node[root].child.size() == 0) hash_table[depth]++;
  20.     for(int i = 0; i < node[root].child.size(); i++){
  21.         int child = node[root].child[i];
  22.         DFS(child, depth + 1);
  23.     }
  24. }
  26. void caculate(){
  27.     int min_index = 0;
  28.     for(int i = 0; i < n; i++){
  29.         if(hash_table[i] != 0){
  30.             min_index = i;
  31.             break;
  32.         }
  33.     }
  34.     printf("%.4f %d", p * pow(1 + r, min_index), hash_table[min_index]);
  35. }
  37. int main(){
  38.     int child_num, child_temp;
  39.     scanf("%d%lf%lf", &n, &p, &r);
  40.     r /= 100;
  41.     for(int i = 0; i < n; i++){
  42.         scanf("%d", &child_num);
  43.         for(int j = 0; j < child_num; j++){
  44.             scanf("%d", &child_temp);
  45.             node[i].child.push_back(child_temp);
  46.         }
  47.     }
  48.     DFS(0, 0);
  49.     caculate();
  50.     return 0;
  51. }