A1106 Lowest Price in Supply Chain (25) 树的遍历

#include<cstdio>
#include<iostream>
#include<vector>
const int maxn=100100;
using namespace std;
int n,num,mindepth=maxn;
double p,r,ans=1;
struct node
{
	int id;
	vector<int>child;
}a[maxn];
void DFS(int depth,int index,double nowr)
{
    if(a[index].child.size()==0)
    {
    	if(depth<mindepth)
    	{
    		mindepth=depth;
    		ans=nowr;
    		num=1;
		}
		else if(depth==mindepth)
	    {
	    	num++;
		}
	}
	for(int i=0;i<a[index].child.size();i++)
	{
		DFS(depth+1,a[index].child[i],nowr*r);
	}
}
int main()
{
	cin>>n>>p>>r;
	r=1+r/100;
	int k,child;
	for(int i=0;i<n;i++)
	{
		scanf("%d",&k);
		for(int j=0;j<k;j++)
		{
			scanf("%d",&child);
			a[i].child.push_back(child);
		}
	}
	DFS(0,0,1);
	printf("%.4lf %d",ans*p,num);
}