A1106 Lowest Price in Supply Chain (25point(s))
题意:
寻找最小深度的叶子节点并统计个数
Sample Input
10 1.80 1.00
3 2 3 5
1 9
1 4
1 7
0
2 6 1
1 8
0
0
0
Sample Output
1.8362 2
#include"bits/stdc++.h"
using namespace std;
struct Node {
vector<int> links;
};
const int maxn = 100005;
Node nodes[maxn];
int ans_depth = INT32_MAX;
int ans_cnt = 0;
void dfs(int id,int depth){
if(nodes[id].links.empty()) {
if(depth < ans_depth){
ans_depth = depth;
ans_cnt = 1;
}else if(depth == ans_depth)
ans_cnt ++;
}
for(int t:nodes[id].links)
dfs(t,depth+1);
}
int main() {
//freopen("input.txt","r",stdin);
int n;
double p,r;
cin >> n >> p >> r;
r /= 100;
r += 1;
for(int i=0; i<n; i++) {
int k; scanf("%d",&k);
for(int j=0; j<k; j++) {
int t; scanf("%d",&t);
nodes[i].links.push_back(t);
}
}
dfs(0,0);
double ans = p*pow(r,ans_depth);
printf("%.4f %d\n",ans,ans_cnt);
}