PTA甲级 1106 Lowest Price in Supply Chain (C++)

最新推荐文章于 2023-05-26 23:04:42 发布

负反馈循环

最新推荐文章于 2023-05-26 23:04:42 发布

阅读量68

点赞数

分类专栏： PTA 文章标签： c++ oj系统

本文链接：https://blog.csdn.net/qq_43659183/article/details/119914009

版权

PTA 专栏收录该内容

148 篇文章 2 订阅

订阅专栏

该博客讨论了一个关于供应链中价格从供应商到零售商传递的模拟问题。输入包含供应链成员数量、初始价格和每次转销的加价比例，输出是顾客可能遇到的最低价格以及提供该价格的零售商数量。解决方案通过广度优先搜索策略遍历供应链，计算最低价格。

摘要由CSDN通过智能技术生成

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:
$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. 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 $10^{10}$ .

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

Solution:

// Talk is cheap, show me the code
// Created by Misdirection 2021-08-25 16:00:56
// All rights reserved.

#include <iostream>
#include <vector>
#include <unordered_map>
#include <queue>
#include <cmath>

using namespace std;

int main(){
    int n;
    double p, r;
    // n - the total number of the members in the supply chain
    // p -  the price given by the root supplier
    // r -  the percentage rate of price increment for each distributor or retailer

    cin >> n >> p >> r;
    vector<vector<int>> net(n);
    unordered_map<int, int> flag;

    for(int i = 0; i < n; ++i){
        int num;
        cin >> num;

        if(num == 0) net[i].push_back(-1);
        else{
            for(int j = 0; j < num; ++j){
                int tmp;
                cin >> tmp;

                net[i].push_back(tmp);
                flag[tmp] = 1;
            }
        }
    }

    int root;
    for(int i = 0; i < n; ++i){
        if(flag[i] == 0){
            root = i;
            break;
        }
    }

    queue<int> q;
    q.push(root);
    int ans = 0, level = 0;
    bool findAns = false;

    while(!q.empty()){
        int size = q.size();

        for(int i = 0; i < size; ++i){
            int tmp = q.front();

            if(net[tmp][0] == -1){
                ans++;
                findAns = true;
            }
            else for(int j = 0; j < net[tmp].size(); ++j) q.push(net[tmp][j]);

            q.pop();
        }

        if(findAns) break;
        level++;
    }

    printf("%.4lf %d\n", p * pow(1 + r / 100.0, level), ans);

    return 0;
}