1106 lowest price in supply chain (25 points)

The main idea of the topic ： Supplier is the root node , Retailers are leaf nodes , Supply goods from top to bottom , Each time the price of the next floor will rise r%, Ask for the lowest price to sell , And the quantity of this price .

bfs,dfs Fine , Find out that this tree is the minimum depth of the retailer , And the minimum depth of this node number .

#include <iostream>
#include <vector>
#include <cmath>
using namespace std;
vector<int>v[100010];
int minh = 1e9,sum;
void dfs(int u,int h)
{   
    if(h > minh) return ;
    if(v[u].size() == 0) // Retailer 
    {
        if(minh > h) minh = h,sum = 1; // Minimum depth 
        else if(minh == h) sum ++;// At the same depth 
    }
    for(int i = 0; i < v[u].size(); i ++) dfs(v[u][i],h + 1);
}
int main()
{
    int n;double p,r;
    cin >> n >> p >> r;
    for(int i = 0; i < n; i ++)
    {
        int k;
        cin >> k;
        for(int j = 0 ; j < k; j ++)
        {
            int a;
            cin >> a;
            v[i].push_back(a);
        }
    }
    dfs(0,0);
    printf("%.4lf %d",p * pow(1 + r / 100,minh),sum);
    return 0;
}