【PAT】1106 Lowest Price in Supply Chain (25 分)

#include 
#include 
#include 
#include 
using namespace std;

struct node
{
    vector children;
};
int n;
double p,r;
vector C;

int cnt=1,min_depth=99999999;
void dfs(int root,int depth){//按层访问
    if(depth>min_depth) return;//大于当前最小深度,则不必继续
    if(C[root].children.size()==0){//叶结点
        if(depth0){
            while(tn--){
                scanf("%d",&t);
                C[i].children.push_back(t);
            }
        }
    }

    dfs(0,0);
    printf("%.4f %d",p*pow(1+0.01*r,min_depth),cnt);

    return 0;
}