1090 Highest Price in Supply Chain

• 1090 Highest Price in Supply Chain

#include<iostream>
#include<queue>
#include<vector>
#include<cmath>
using namespace std;
int n, t, root, maxd = 0, cnt = 0;
double p, r;
vector<int>v[1000000];
void bfs(int idx) {
    queue<int>q;
    q.push(idx);
    while (!q.empty()){
        int len = q.size();
        for (int i = 0; i < len; i++) {
            int t = q.front();
            for (int j = 0; j < v[t].size(); j++) {
                q.push(v[t][j]);
            }
            q.pop();
        }
        cnt = len;
        maxd++;
    }
}
void dfs(int idx,int d) {
    if (v[idx].size() == 0) {
        if (maxd < d) {
            maxd = d;
            cnt = 1;
        }
        if (maxd == d) {
            cnt++;
        }
        return;
    }
    for (int i = 0; i < v[idx].size(); i++)
        dfs(v[idx][i], d + 1);
}
int main(){
    cin >> n >> p >> r;
    for (int i = 0; i < n; i++) {
        cin >> t;
        if (t == -1)root = i;
        else v[t].push_back(i);
    }
    //bfs(root);
    //printf("%.2f %d", p * pow(1 + r * 0.01, maxd - 1), cnt);
    dfs(root, 0);
    printf("%.2f %d", p * pow(1 + r * 0.01, maxd), cnt);
    return 0;
}