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

注意本题接收数据和前面的不同，注意不要想当然混淆题目意思

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