PATA1106_(难度：⭐️)

用队列层次遍历就ok了。

#include<bits/stdc++.h>
using namespace std;
struct node {
    int layer;
    vector<int> v;
};
vector<node> ans;
unordered_map<int, int> mp;
int main() {
    int n, k, a, minLayer = 999999;
    double p, r, minPrice = 0.0;
    cin >> n >> p >> r;
    ans.resize(n);
    for (int i = 0; i < n; i++) {
        scanf ("%d", &k);
        for (int j = 0; j < k; j++) {
            scanf ("%d", &a);
            ans[i].v.push_back(a);
        }
    }
    ans[0].layer = 0;
    queue<node> q;
    q.push(ans[0]);
    while (!q.empty()) {
        node now = q.front();
        q.pop();
        for (int i = 0; i < now.v.size(); i++) {
            int cld = now.v[i];
            ans[cld].layer = now.layer + 1;
            q.push(ans[cld]);
        }
    }
    for (int i = 0; i < n; i++) {
        if (ans[i].v.size() == 0) {
            mp[ans[i].layer]++;
            if (minLayer > ans[i].layer) minLayer = ans[i].layer;
        }
    }
    minPrice = p * pow(1.0 + 0.01 * r, minLayer * 1.0);
    printf ("%.4lf %d", minPrice, mp[minLayer]);
}