zoukankan      html  css  js  c++  java
  • PAT 甲级 1079 Total Sales of Supply Chain

    https://pintia.cn/problem-sets/994805342720868352/problems/994805388447170560

    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 (≤), the total number of the members in the supply chain (and hence their ID's are numbered from 0 to N1, 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:

    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, then instead the total amount of the product will be given after Kj​​. 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 1.

    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

    代码:

    #include <bits/stdc++.h>
    using namespace std;
    
    struct node {
        double data;
        vector<int> child;
    };
    
    vector<node> v;
    double ans = 0.0, p, r;
    
    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;
    }
    

      用 vector 写就超时 气气 渐渐失去希望

  • 相关阅读:
    超详细的FreeRTOS移植全教程——基于srm32
    继续学习freertos消息队列
    FreeRTOS优化与错误排查方法
    从单片机到操作系统⑦——深入了解FreeRTOS的延时机制
    Android Pie 私人 DNS 使用教程
    「运维之美」技术周刊 ( 第 1 期 )
    「运维之美」技术周刊 ( 第 3 期 )
    用 Python 快速实现 HTTP 和 FTP 服务器
    关于ubuntu软件图标的问题
    You're currently running Fcitx with GUI 错误解决 Fcitx
  • 原文地址:https://www.cnblogs.com/zlrrrr/p/10391152.html
Copyright © 2011-2022 走看看