1090. Highest Price in Supply Chain (25)

#include <iostream>
#include <vector>
#include <queue>

using namespace std;

vector<int> v[100010];
queue<int> q;
double p, r;
int res;

void bfs()
{
	int qsize = q.size(), cur, vsize, i;
	res = qsize;

	while(qsize--)
	{
		cur = q.front();
		q.pop();

		vsize = v[cur].size();
		for(i = 0; i < vsize; i++)
		{
			q.push(v[cur][i]);
		}
	}

	qsize = q.size();
	if(qsize > 0)
	{
		p *= r;
		bfs();
	}
}

int main()
{
	int n;
	scanf("%d%lf%lf", &n, &p, &r);
	r = 1 + r / 100;

	int i, root, curroot;
	for(i = 0; i < n; i++)
	{
		scanf("%d", &curroot);

		if(curroot == -1)
		{
			root = i;
		}
		else
		{
			v[curroot].push_back(i);
		}
	}

	q.push(root);
	bfs();

	printf("%.2lf %d\n", p, res);

	system("pause");
	return 0;
}