A1106 Lowest Price in Supply Chain （25 分）

#include<cstdio>
#include<vector>
#include<cmath>
using namespace std;
int n;
double p, r;
const int maxn = 100010;
vector<int> v[maxn];
int mindepth=maxn;
int num;
void dfs(int root,int depth)
{
	if (v[root].size() == 0)
	{
		if (depth < mindepth)
		{
			mindepth = depth;
			num = 1;//最低商家数量设为1
		}
		else if (depth == mindepth) num++;
		return;
	}
	for (int i = 0; i < v[root].size(); i++)
	{
		dfs(v[root][i], depth + 1);
	}
}
int main()
{
	int cnum,temp;
	scanf("%d%lf%lf", &n, &p, &r);
	r /= 100;
	for (int i = 0; i < n; i++)
	{
		scanf("%d", &cnum);
		for (int j = 0; j < cnum; j++)
		{
			scanf("%d", &temp);
			v[i].push_back(temp);
		}
	}
	dfs(0, 0);
	printf("%.4f %d", p*pow(1 + r, mindepth), num);
	return 0;
}