#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
using namespace std;
vector<int> v[100001];
vector<int> amount[100001];
int n;
double sum = 0, p, r;
void dfs(int index, int depth){
if (v[index].size() == 1 && v[index][0] == -1) {
sum += pow(1 + r/100, depth) * amount[index][0];
return;
}
for (int i = 0; i < v[index].size(); i++) {
dfs(v[index][i], depth + 1);
}
}
int main(){
cin >> n >> p >> r;
for (int i = 0; i < n; i++) {
int c;
cin >> c;
if (c == 0) {
v[i].push_back(-1);
int k;
cin >> k;
amount[i].push_back(k);
}else{
for (int j = 0; j < c; j++) {
int k;
cin >> k;
v[i].push_back(k);
}
}
}
dfs(0, 0);
printf("%.1lf\n", sum * p);
return 0;
}
1079. Total Sales of Supply Chain (25) dfs
最新推荐文章于 2020-09-23 10:13:56 发布