1079. Total Sales of Supply Chain (25)-求数的层次和叶子节点

和下面是同类型的题目，只不过问的不一样罢了：

1090. Highest Price in Supply Chain (25)-dfs求层数

1106. Lowest Price in Supply Chain (25)-(dfs计算树的最小层数)

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <string.h>
#include <cmath>
using namespace std;
/*
计算最小的层数与该层数上的叶子节点数目即可
建树用的是链式前向星模板，不了解的参考：
http://www.cnblogs.com/chenxiwenruo/p/4513754.html
*/
const int maxn=100000+5;
int product[maxn];
int head[maxn];
int tot=0;
double sum=0,p,r;
int cnt=0;
struct Edge{int to,next;
}edge[maxn];
void add(int x,int y){edge[tot].next=head[x];edge[tot].to=y;head[x]=tot++;
}
void init(){memset(head,-1,sizeof(head));tot=0;
}void dfs(int i,int layer){if(head[i]==-1){sum+=product[i]*p*pow(1+r/100,layer);return;}for(int k=head[i];k!=-1;k=edge[k].next){int v=edge[k].to;dfs(v,layer+1);}
}
int main()
{int n;scanf("%d %lf %lf",&n,&p,&r);int a,b;memset(product,0,sizeof(product));init();for(int i=0;i<n;i++){scanf("%d",&a);if(a==0){scanf("%d",&product[i]);}for(int j=0;j<a;j++){scanf("%d",&b);add(i,b);}}dfs(0,0);printf("%.1lf",sum);return 0;
}

View Code

转载于:https://www.cnblogs.com/chenxiwenruo/p/6390154.html

1079. Total Sales of Supply Chain (25)-求数的层次和叶子节点相关推荐

1079. Total Sales of Supply Chain (25)-PAT甲级真题（dfs,bfs,树的遍历）
A supply chain is a network of retailers(零售商), distributors(经销商), and suppliers(供应商)-- everyone invo ...
PAT甲级 -- 1079 Total Sales of Supply Chain (25 分)
A supply chain is a network of retailers(零售商), distributors(经销商), and suppliers(供应商)-- everyone invo ...
1079. Total Sales of Supply Chain (25)
A supply chain is a network of retailers(零售商), distributors(经销商), and suppliers(供应商)-- everyone invo ...
1079 Total Sales of Supply Chain(甲级)
1079 Total Sales of Supply Chain (25分) A supply chain is a network of retailers(零售商), distributors(经 ...
PAT 1079 Total Sales of Supply Chain[比较]
1079 Total Sales of Supply Chain(25 分) A supply chain is a network of retailers(零售商), distributors(经 ...
PAT甲级1079 Total Sales of Supply Chain：[C++题解] 树、结点到根结点的距离、树形dp、记忆化搜索
文章目录题目分析题目链接题目分析来源:acwing 分析:下图是对样例的模拟图示,题目就是统计叶子结点卖出去的钱数.根据下图,我们第一步是建树,第二步是统计叶子结点到根结点的距离,然后才能知道 ...
PAT 1079. Total Sales of Supply Chain
A supply chain is a network of retailers(零售商), distributors(经销商), and suppliers(供应商)-- everyone invo ...
1079 Total Sales of Supply Chain
1. 这道题考察的是树的层次遍历,结点需要有层这个属性,对于我来说,难点在于什么时候给层赋值,看书后知道应该是在加入队列之前(不管是根节点还是之后所有节点). 2. 一开始算得216,原因是把r直接加 ...
【PAT】A1079 Total Sales of Supply Chain
A supply chain is a network of retailers(零售商), distributors(经销商), and suppliers(供应商)-- everyone invo ...
分别采用递归和非递归方式编写两个函数，求一棵二叉树中叶子节点个数
分别采用递归和非递归方式编写两个函数,求一棵二叉树中叶子节点个数 #include #include #define MAXSIZE 50 typedef char datatype; typedef ...

1079. Total Sales of Supply Chain (25)-求数的层次和叶子节点

1079. Total Sales of Supply Chain (25)-求数的层次和叶子节点相关推荐

最新文章

热门文章