L2-020 功夫传人 (25 分)

原题链接

#include <bits/stdc++.h>
using namespace std;
int n, k, x;
double z, r, ans;
double p[111111];
int vis[111111];
vector<int> w[111111];
void bfs(int x)
{
    queue<int> vv;
    vv.push(x);
    while (!vv.empty())
    {
        int temp = vv.front();
        vv.pop();
        for (auto e : w[temp])
        {
            if (vis[e] == 1)
            {
                p[e] = p[temp] * w[e][0] * (1 - r / 100);
                ans += p[e];
            }
            else
            {
                vv.push(e);
                p[e] = p[temp] * (1 - r / 100);
            }
        }
    }
}
int main()
{
    cin >> n >> z >> r;
    p[0] = z;
    for (int i = 0; i < n; i++)
    {
        cin >> k;
        if (k == 0)
        {
            cin >> x;
            vis[i] = 1;
            w[i].push_back(x);
        }
        else
        {
            for (int j = 0; j < k; j++)
            {
                cin >> x;
                w[i].push_back(x);
            }
        }
        if (n == 1)
        {
            cout << z * w[0][0];
            return 0;
        }
    }
    bfs(0);
    cout << int(ans);
    return 0;
}