PAT Advanced 1106 Lowest Price in Supply Chain (25) [DFS,BFS,树的遍历]
题目
A supply chain is a network of retailers(零售商), distributors(经销商), and suppliers(供应商)– everyone involved in moving a product from supplier to customer. Starting from one root supplier, everyone on the chain buys products from one’s supplier in a price P and sell or distribute them in a price that is r% higher than P. Only the retailers will face the customers. It is assumed that each member in the supply chain has exactly one supplier except the root supplier, and there is no supply cycle.
Now given a supply chain, you are supposed to tell the lowest price a customer can expect from some retailers.
Input Specification:
Each input file contains one test case. For each case, The first line contains three positive numbers: N(<=10^5), the total number of the members in the supply chain (and hence their ID’s are numbered from 0 to N-1, and the root supplier’s ID is 0); P, the price given by the root supplier; and r, the percentage rate of price increment for each distributor or retailer. Then N lines follow, each describes a distributor or retailer in the following format:
Ki ID[1] ID[2] … ID[Ki]
where in the i-th line, Ki is the total number of distributors or retailers who receive products from supplier i, and is then followed by the ID’s of these distributors or retailers. Kj being 0 means that the j-th member is a retailer. All the numbers in a line are separated by a space.
Output Specification:
For each test case, print in one line the lowest price we can expect from some retailers, accurate up to 4 decimal places, and the number of retailers that sell at the lowest price. There must be one space between the two numbers. It is guaranteed that the all the prices will not exceed 1010.
Sample Input:
10 1.80 1.00
3 2 3 5
1 9
1 4
1 7
0
2 6 1
1 8
000
Sample Output:
1.8362 2
题目分析
已知所有非叶子节点的所有子节点,求最短路径(根节点到叶子节点)的层数和该层叶子节点数
解题思路
思路 01
- dfs遍历树,参数h记录当前节点所在层数,统计所有层叶子结点数
- 找出出现叶子节点的最小层,并计算该层价格
思路 02
- dfs遍历树,参数p记录当前节点所在层的价格,min_h记录出现叶子节点的最小层,min_num记录max_p层叶子节点数
思路 03
- bfs遍历树,int h[n]数组记录当前节点所在层,统计所有层叶子结点数
- 找出出现叶子节点的最小层,计算该层价格
思路 04
- bfs遍历树,double ps[n]数组记录当前节点所在层的价格,min_h记录出现叶子节点的最小层,min_num记录max_p层叶子节点数
Code
Code 01(dfs)
#include <iostream>
#include <vector>
#include <cmath>
using namespace std;
const int maxn = 100000;
vector<int> nds[maxn];
double p,r;
int cns[maxn],leaf[maxn],max_h;
void dfs(int index, int h){
max_h=max(max_h,h);
if(cns[index]==0){
leaf[h]++; //对应层级叶子节点数+1;
return;
}
for(int i=0;i<cns[index];i++){
dfs(nds[index][i],h+1);
}
}
int main(int argc, char * argv[]) {
int n,cid;
scanf("%d %lf %lf",&n,&p,&r);
for(int i=0; i<n; i++) {
scanf("%d",&cns[i]);
for(int j=0;j<cns[i];j++){
scanf("%d",&cid);
nds[i].push_back(cid);
}
}
dfs(0,0);
int min_h=0;
while(min_h<=max_h&&leaf[min_h]==0)min_h++;
printf("%.4f %d",p*pow(1+r*0.01,min_h),leaf[min_h]);
return 0;
}
Code 02(dfs 优化版)
#include <iostream>
#include <vector>
#include <cmath>
using namespace std;
const int maxn = 100000;
vector<int> nds[maxn];
double p,r;
int cns[maxn],min_num,min_h=99999999;
void dfs(int index, int h){
if(min_h<h){
return;
}
if(cns[index]==0){
if(min_h==h){
min_num++;
}else if(min_h>h){
min_h=h;
min_num=1;
}
}
for(int i=0;i<cns[index];i++){
dfs(nds[index][i],h+1);
}
}
int main(int argc, char * argv[]) {
int n,cid;
scanf("%d %lf %lf",&n,&p,&r);
for(int i=0; i<n; i++) {
scanf("%d",&cns[i]);
for(int j=0;j<cns[i];j++){
scanf("%d",&cid);
nds[i].push_back(cid);
}
}
dfs(0,0);
printf("%.4f %d",p*pow(1+r*0.01,min_h),min_num);
return 0;
}
Code 03(bfs)
#include <iostream>
#include <vector>
#include <queue>
#include <cmath>
using namespace std;
const int maxn=100000;
vector<int> nds[maxn];
double p,r;
int cns[maxn],cnt,max_h,h[maxn],leaf[maxn];
bool flag;
void bfs() {
queue<int> q;
q.push(0);
while(!q.empty()) {
int now = q.front();
q.pop();
max_h=max(max_h,h[now]);
if(cns[now]==0) {
leaf[h[now]]++; //对应层级叶子结点数+1;
} else {
for(int i=0; i<cns[now]; i++) {
h[nds[now][i]] = h[now]+1;
q.push(nds[now][i]);
}
}
}
}
int main(int argc,char * argv[]) {
int n,k,cid;
scanf("%d %lf %lf",&n,&p,&r);
for(int i=0; i<n; i++) {
scanf("%d",&cns[i]);
for(int j=0; j<cns[i]; j++) {
scanf("%d",&cid);
nds[i].push_back(cid);
}
}
h[0]=0;
bfs();
int min_h=0;
while(min_h<=max_h&&leaf[min_h]==0)min_h++;
printf("%.4f %d",p*pow(1+r*0.01,min_h),leaf[min_h]);
return 0;
}
Code 04(bfs 优化版)
#include <iostream>
#include <vector>
#include <queue>
#include <cmath>
using namespace std;
const int maxn=100000;
vector<int> nds[maxn];
double p,r;
int cns[maxn],cnt,min_h=9999999,min_num,h[maxn];
bool flag;
void bfs() {
queue<int> q;
q.push(0);
while(!q.empty()) {
int now = q.front();
q.pop();
if(cns[now]==0) {
if(min_h>h[now]){
min_h=h[now];
min_num=1;
}else if(min_h==h[now]){
min_num++;
}
} else {
for(int i=0; i<cns[now]; i++) {
h[nds[now][i]] = h[now]+1;
q.push(nds[now][i]);
}
}
}
}
int main(int argc,char * argv[]) {
int n,k,cid;
scanf("%d %lf %lf",&n,&p,&r);
for(int i=0; i<n; i++) {
scanf("%d",&cns[i]);
for(int j=0; j<cns[i]; j++) {
scanf("%d",&cid);
nds[i].push_back(cid);
}
}
h[0]=0;
bfs();
printf("%.4f %d",p*pow(1+r*0.01,min_h),min_num);
return 0;
}
PAT Advanced 1106 Lowest Price in Supply Chain (25) [DFS,BFS,树的遍历]的更多相关文章
- PAT甲题题解-1106. Lowest Price in Supply Chain (25)-(dfs计算树的最小层数)
统计树的最小层数以及位于该层数上的叶子节点个数即可. 代码里建树我用了邻接链表的存储方式——链式前向星,不了解的可以参考,非常好用: http://www.cnblogs.com/chenxiwenr ...
- PAT甲级——1106 Lowest Price in Supply Chain(BFS)
本文同步发布在CSDN:https://blog.csdn.net/weixin_44385565/article/details/90444872 1106 Lowest Price in Supp ...
- [建树(非二叉树)] 1106. Lowest Price in Supply Chain (25)
1106. Lowest Price in Supply Chain (25) A supply chain is a network of retailers(零售商), distributors( ...
- PAT 甲级 1106 Lowest Price in Supply Chain
https://pintia.cn/problem-sets/994805342720868352/problems/994805362341822464 A supply chain is a ne ...
- 1106. Lowest Price in Supply Chain (25)
A supply chain is a network of retailers(零售商), distributors(经销商), and suppliers(供应商)-- everyone invo ...
- PAT Advanced 1090 Highest Price in Supply Chain (25) [树的遍历]
题目 A supply chain is a network of retailers(零售商), distributors(经销商), and suppliers(供应商)–everyone inv ...
- PAT Advanced 1079 Total Sales of Supply Chain (25) [DFS,BFS,树的遍历]
题目 A supply chain is a network of retailers(零售商), distributors(经销商), and suppliers(供应商)– everyone in ...
- PAT (Advanced Level) 1106. Lowest Price in Supply Chain (25)
简单dfs #include<cstdio> #include<cstring> #include<cmath> #include<vector> #i ...
- 【PAT甲级】1106 Lowest Price in Supply Chain (25分)
题意:输入一个正整数N(<=1e5),两个小数P和R,分别表示树的结点个数和商品原价以及每下探一层会涨幅的百分比.输出叶子结点深度最小的商品价格和深度最小的叶子结点个数. trick: 测试点1 ...
随机推荐
- 在excel表格里,为所有数字添上绿色小三角
在excel表格里,为所有数字添上绿色小三角的方法有4种: 1. 为一个单元格添加:直接在单元格里添加一个英文的逗号 2. 为一列数据添加:选中要添加绿色小三角的列,选择 数据-->分列--&g ...
- ffmpeg “inttypes.h”: No such file or directory
编译过程:错误一:无法打开包括文件:“inttypes.h”: No such file or directory解决方法:删除之,并在其之前添加如下代码: #if defined(WIN32) &a ...
- 049-PHP输出当前文件的名称
<?php echo __FILE__; //利用常量__FILE__输出当前文件的名称 ?>
- 046-unset对静态变量无法销毁
<?php function digui() { static $count = 0; echo $count; $count++; unset($count); } digui(); digu ...
- Flink on yarn以及实现jobManager 高可用(HA)
on yarn https://ci.apache.org/projects/flink/flink-docs-release-1.8/ops/deployment/yarn_setup.html f ...
- JS笔记03
JS图片库 标记 需求效果: 网页中的图片链接显示在网页中的图片框内部而不是打开新的页面 //html部分 <!DOCTYPE html> <html> <head> ...
- Spring 面向切面编程(AOP)
Spring 系列教程 Spring 框架介绍 Spring 框架模块 Spring开发环境搭建(Eclipse) 创建一个简单的Spring应用 Spring 控制反转容器(Inversion of ...
- vue小练习--音乐播放器
1 首先建一个文件夹 放几首歌曲 2 看代码 1)基本版本 <!DOCTYPE html> <html lang="zh-CN"> <head> ...
- mysql 分组查询教程
1.分组 分组就是将一个“数据集”划分成若干个“小区域”,然后针对若干个“小区域”进行数据处理. 2.分组的特点 1.)group by的含义:将查询结果按照1个或多个字段进行分组,字段值相同的为一组 ...
- html 基础 (9.19 第八天)
一.HTML:超文本标记语言,是一种标签语言,不是编程语言,显示数据有双标签<body></body> 和单标签<img src=# / >, 标签大小写都可以通过 ...