PAT甲1106. Lowest Price in Supply Chain (25)

#include <cstdio>
#include <cstdlib>
#include <string.h>
#include <cmath>
#include <algorithm>
#include <string>
#include <iostream>
#include <vector>
#include <set>
#include <map>
#include <stack>
#include <queue>
using namespace std;

int N;
double rootprice,incre;
struct Node
{
    int layer;
    bool r;
    vector<int> child;
    Node()
    {
        r=false;
    }
}node[100010];

int minlayer=999999;

void BFS()
{
    queue<Node> q;
    node[0].layer=0;
    q.push(node[0]);
    while(!q.empty())
    {
        Node top=q.front();
        q.pop();
        if(top.r)
        {
            if(minlayer>(top.layer))
                minlayer=top.layer;
        }
        for(int i=0;i<top.child.size();i++)
        {
            node[top.child[i]].layer=top.layer+1;
            q.push(node[top.child[i]]);

        }
    }
}

int main()  
{   
    scanf("%d%lf%lf",&N,&rootprice,&incre);
    for(int i=0;i<N;i++)
    {
        int c;
        scanf("%d",&c);
        if(c==0)
        {
            node[i].r=true;
        }
        else if(c>0)
        {
            for(int j=0;j<c;j++)
            {
                int d;
                scanf("%d",&d);
                node[i].child.push_back(d);
            }
        }
    }
    BFS();
    int c=0;
    for(int i=0;i<N;i++)
    {
        if(node[i].layer==minlayer&&node[i].r)
        {
            c++;
        }
    }
    double inc=incre/100.0+1.0;
    double price=rootprice*pow(inc,minlayer);
    printf("%.4f %d\n",price,c);
    system("pause");
    return 0;
}