1079 Total Sales of Supply Chain (25分)

题目

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(\le 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 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 $10^{10}$.

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

题目大意

给出一条供应商到销售商的供应链，约定条件最起始的供应商为0号，且中间商不零售，商品没流通一环，价格上涨$r$倍，要求输出零售商的所有销售额之和。

解题思路

画出供应链图，很明显这是树的结构，所以按照树的层次遍历计算，每当层次增加，价格上涨相应倍数，当遍历到叶节点时计算销售额；

代码

#include <iostream>
#include <cstdio>
#include <vector>
#include <queue>
using namespace std;

const int MAXN = 100000;

struct Node{
    int data;
    vector<int> next;
};

int main(){
    int n;
    double p, r;
    vector<Node> v;
    scanf("%d %lf %lf", &n, &p, &r);
    v.resize(n);
    for(int i=0, t; i<n; i++){
        scanf("%d", &t);
        if(t > 0){
            for(int j=0, d; j<t; j++){
                scanf("%d", &d);
                v[i].next.push_back(d);
            }
        }
        else{
            scanf("%d", &v[i].data);
        }
    }
    queue<int> que;
    double ans = 0.0;
    que.push(0);
    while(!que.empty()){
        int t = que.size();
        for(int i=0; i<t; i++){
            int temp = que.front();
            for(int j=0; j<v[temp].next.size(); j++)
                que.push(v[temp].next[j]);
            if(v[temp].next.empty()){
                ans += p*v[temp].data;
                //printf("%d %d %lf %lf\n", temp, v[temp].data, p, ans);
            }
            que.pop();
        }
        p *= (1 + r*0.01);
    }
    printf("%.1lf\n", ans);
    return 0;
}