PATA1090题解

树的层序遍历

//
//  main.cpp
//  PATA1090
//
//  Created by Phoenix on 2018/2/21.
//  Copyright © 2018年 Phoenix. All rights reserved.
//

#include <iostream>
#include <cstdio>
#include <vector>
#include <queue>
using namespace std;
const int maxn = 100010;
int n, root;
double p, r;

struct node {
    vector<int> child;
}node[maxn];

void level() {
    queue<int> q;
    q.push(root);
    int lastnode = root, newlastnode = -1, num = 0;
    double price = p;
    while(!q.empty()) {
        int top = q.front();
        q.pop();
        num++;
        for(int i = 0; i < node[top].child.size(); i++) {
            q.push(node[top].child[i]);
            newlastnode = node[top].child[i];
        }
        if(!q.empty() && top == lastnode) {
            price *= (1 + r / 100);
            lastnode = newlastnode;
            num = 0;
        }
    }
    printf("%.2f %d\n", price, num);
}

int main(int argc, const char * argv[]) {
    scanf("%d %lf %lf", &n, &p, &r);
    for(int i = 0; i < n; i++) {
        int a;
        scanf("%d", &a);
        if(a == -1) root = i;
        else{
            node[a].child.push_back(i);
        }
    }
    level();
    return 0;
}