PAT a1106题解

#include <cstdio>#include <cmath>#include <vector>using namespace std;const int maxn = 100010;vector<int> Node[maxn];const double INF = 1e12;int n, num = 0;double p, r, ans = INF;void DFS(int index, int depth){if(Node[index].size() == 0){double price = p * pow(1 + r, depth);if(price < ans){ans = price;num = 1;} else if(price == ans){num++;}return;}for(int i = 0; i < Node[index].size(); i++){DFS(Node[index][i], depth + 1);}} int main(){int k, child;scanf("%d%lf%lf0", &n, &p, &r);r /= 100;for(int i = 0; i < n; i++){scanf("%d", &k);if(k != 0){for(int j = 0; j < k; j++){scanf("%d", &child);Node[i].push_back(child);}}}DFS(0, 0);printf("%.4f %d\n", ans, num);return 0;}