1106 Lowest Price in Supply Chain

 1 #include<iostream>
 2 #include<vector>
 3 #include<map>
 4 using namespace std;
 5 
 6 const int maxn = 100010;
 7 vector<int> node[maxn];
 8 int n,k,child;
 9 double p,r;
10 map<double,int> mp;
11 void DFS(int root, double price) { //树的先序遍历
12     if(node[root].size() == 0) { //叶子节点
13         mp[price]++;
14         return ;
15     }
16     for(int i = 0; i < node[root].size(); ++i) {
17         DFS(node[root][i],price*(1+r));
18     }
19 }
20 
21 int main() {
22     cin>>n>>p>>r;
23     r/=100;
24     for(int i = 0; i < n; ++i) {
25         cin>>k;
26         if(k != 0) {
27             for(int j = 0 ; j < k; ++j) {
28                 cin>>child;
29                 node[i].push_back(child);
30             }
31         }
32     }
33     DFS(0,p);
34     auto it = mp.begin();
35     printf("%.4f %d",it->first,it->second);
36     return 0;
37 }