1106. Lowest Price in Supply Chain (25)

    DFS走一遍找最低高度的路径

#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <cmath>

using namespace std;

#define INF (~(1<<31))

vector<vector<int>> nodes;
vector<int> results;

void dfs(int root, int level, int& minLevel){
	if(nodes[root].empty()){
		if(level < minLevel){
			minLevel = level;
			results = vector<int>(1, root);
		}else if(level == minLevel){
			results.push_back(root);
		}

		return;
	}

	if(level > minLevel) return;

	for(size_t i = 0; i < nodes[root].size(); ++i){
		dfs(nodes[root][i], level+1, minLevel);
	}
}

int main(){
	int n;
	double p, r;
	cin >> n >> p >> r;

	nodes.resize(n);
	for(int i = 0; i < n; ++i){
		int k, id;
		scanf("%d", &k);

		for(int j = 0; j < k; ++j){
			scanf("%d", &id);
			nodes[i].push_back(id);
		}
	}

	int minLevel = INF;
	dfs(0, 0, minLevel);

	printf("%.4f %d", p*pow(1+r/100, minLevel), (int)results.size());

	return 0;
}