1106 Lowest Price in Supply Chain (25 分)（BFS）

#include <cstdio>
#include <vector>
#include<queue>
#include<algorithm>
using namespace std;
struct node
{
    double layer;
    vector<int>child;
}Node[111100];
int n;
double u,p;
double sum = 1<<30;

void Bfs(int root)
{
    queue<int>q;
    q.push(root);

    while(!q.empty())
    {
        int s = q.front();
        q.pop();
        for(int i = 0;i<Node[s].child.size();i++)
        {
            int cid = Node[s].child[i];
            Node[cid].layer = Node[s].layer * (1 + p*0.01);
            q.push(cid);
        }
        if(Node[s].child.size() == 0 && sum > Node[s].layer)
        {
            sum = Node[s].layer;
        }
    }
}

int main()
{
    scanf("%d%lf%lf",&n,&u,&p);
    Node[0].layer = u;
    for(int i = 0;i<n;i++)
    {
        int t;
        scanf("%d",&t);
        for(int j = 0;j<t;j++)
        {
            int id;
            scanf("%d",&id);
            Node[i].child.push_back(id);
        }
    }
    Bfs(0);
    int cou = 0;
    for(int i = 0;i<n;i++)
    {
        if(Node[i].child.size() == 0 && Node[i].layer == sum)
        {
            cou++;
        }
    }
    printf("%.4lf %d",sum,cou);

}