PTA甲级 1079 Total Sales of Supply Chain (25分)

最新推荐文章于 2021-11-02 20:42:53 发布

Camilleferros

最新推荐文章于 2021-11-02 20:42:53 发布

阅读量230

点赞数

分类专栏： PTA甲级

本文链接：https://blog.csdn.net/Huangpengyu123/article/details/109015604

版权

PTA甲级专栏收录该内容

117 篇文章 4 订阅

订阅专栏

强烈推荐,刷PTA的朋友都认识一下柳神–PTA解法大佬

本文由参考于柳神博客写成

柳神的CSDN博客,这个可以搜索文章

柳神的个人博客,这个没有广告,但是不能搜索

还有就是非常非常有用的算法笔记全名是

算法笔记  上级训练实战指南		//这本都是PTA的题解
算法笔记

PS 今天也要加油鸭

在这里插入图片描述

题目原文

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 total sales from all the retailers.

Input Specification:

Each input file contains one test case. For each case, the first line contains three positive numbers: N (≤105), 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 unit 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:

K**i ID[1] ID[2] … ID[K**i]

where in the i-th line, K**i 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. K**j being 0 means that the j-th member is a retailer, then instead the total amount of the product will be given after K**j. All the numbers in a line are separated by a space.

Output Specification:

For each test case, print in one line the total sales we can expect from all the retailers, accurate up to 1 decimal place. It is guaranteed that the number will not exceed 1010.

Sample Input:

10 1.80 1.00
3 2 3 5
1 9
1 4
1 7
0 7
2 6 1
1 8
0 9
0 4
0 3

Sample Output:

42.4

生词如下:

PS:就是连在一起看不懂,单个的词,基本上还是看得懂的.

chain 链

involved 涉及

PS:吐槽,除了上面的词,每个词我都认识,但是连在一起,就是不认识.

题目大意:

一个供应链有供应商和分销商和零售商

供应商只有一个,分销商和零售有许多.

现在有一个层次系统.

每一层要收一个转手费.

最后的叶子节点是零售商

会显示有多少个零售商.问你这个东西一共卖出去了多少钱.

思路如下:

① 仿照原来的二叉树,这里我们还是建立一个静态树. (静态树好写)

② 然后这个节点里面需要有一个child数组,就是儿子节点,还有一个data,用来保存有多少零售商(虽然只有叶子节点才能用),还有一个level 层级

③ 然后就是中序遍历一遍.计算出每个节点的层级.当然别的遍历也可以.

然后就是简单的算钱了.

我的思路是不行的.中序遍历啥的,空间要求太大了.会卡死的.

柳神的思路：

分析：树的遍历，可以采用dfs或者bfs两种方法。
采用dfs，建立结构体数组保存每一个结点的孩子结点的下标，如果没有孩子结点，就保存这个叶子结点的data（销售的量）。深度优先遍历的递归出口，即当前下标的结点没有孩子结点的时候，就把ans += data（货物量）* pow(1 + r, depth)计算货物量*价格引起的涨幅百分比。如果有孩子结点，就dfs深度优先遍历每一个孩子结点，并且在当前depth层数的基础上+1。最后输出ans * p（销售价格），即总价格

柳神代码如下:

#include <cstdio>
#include <vector>
#include <cmath>
using namespace std;
struct node {
    double data;
    vector<int> child;
};
vector<node> v;
double ans = 0.0, p, r;
//DFS就是遍历的算法
void dfs(int index, int depth) {
    if (v[index].child.size() == 0) {
        ans += v[index].data * pow(1 + r, depth);
        return;
    }
    for (int i = 0; i < v[index].child.size(); i++)
        dfs(v[index].child[i], depth + 1);
}
int main() {
    int n, k, c;
    scanf("%d %lf %lf", &n, &p, &r);
    r = r / 100;
    v.resize(n);
    for (int i = 0; i < n; i++) {
        scanf("%d", &k);
        if (k == 0) {
            scanf("%lf", &v[i].data);
        }
        else {
            for (int j = 0; j < k; j++) {
                scanf("%d", &c);
                v[i].child.push_back(c);
            }
        }
    }
    dfs(0, 0);
    printf("%.1f", ans * p);
    return 0;
}