1106. Lowest Price in Supply Chain (25) dfs

#include <iostream>
#include <vector>
#include <cmath>
using namespace std;
int n, mindepth = 9999999, minnum = 0;
double p, r;
vector<int> v[100001];

void dfs(int index, int depth){
    if (depth > mindepth) return;
    if (v[index].size() == 0) {
        if (mindepth == depth) {
            minnum++;
        }else if(depth < mindepth){
            mindepth = depth;
            minnum = 1;
        }
    }
    for (int i = 0; i < v[index].size(); i++) {
        dfs(v[index][i], depth + 1);
    }
}

int main(){
    cin >> n >> p >> r;
    for (int i = 0; i < n; i++) {
        int c;
        cin >> c;
        for (int j = 0; j < c; j++) {
            int k;
            cin >> k;
            v[i].push_back(k);
        }
    }
    dfs(0, 0);
    
    printf("%.4lf %d\n", p * pow(1 + r/100, mindepth), minnum);
    
    return 0;
}