1106. Lowest Price in Supply Chain (25)解题报告

层序遍历，很简单。

#define _CRT_SECURE_NO_WARNINGS
#include <cstdio>
#include <cstdlib>
#include <queue>
#include <vector>
#include <cmath>

using namespace std;

int levelOrder(vector<int> tree[], int N, int &num);
int main(void) 
{
	int N, i, j, num, amplify, cnt, child;
	double P, r, lowest;
	scanf("%d %lf %lf", &N, &P, &r);
	vector<int> *tree = new vector<int>[N];
	for (i = 0; i < N; i++) {
		scanf("%d", &cnt);
		for (j = 0; j < cnt; j++) {
			scanf("%d", &child);
			tree[i].push_back(child);
		}
	}
	amplify = levelOrder(tree, N, num);
	printf("%.4lf %d", pow(1.0 + r / 100.0, amplify) * P, num);
	delete[] tree;
	return 0;
}

int levelOrder(vector<int> tree[], int N, int &num) 
{
	int level = -1, tmp_last, last, tmp;
	queue<int> q;
	num = 0;
	q.push(0);
	last = 0;
	while (!q.empty()) {
		tmp = q.front();
		q.pop();
		if (!tree[tmp].size()) {
			num++;
		}
		for (auto &t : tree[tmp]) {
			q.push(t);
			tmp_last = t;
		}
		if (last == tmp) {
			last = tmp_last;
			level++;
			if (num) {
				break;
			}
		}
	}
	return level;
}