1090 Highest Price in Supply Chain (25)(25 分)

1001-高同学

发表文章数:265

首页 » LeetCode » 正文

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. 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 highest price we 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 they are numbered from 0 to N-1); P, the price given by the root supplier; and r, the percentage rate of price increment for each distributor or retailer. Then the next line contains N numbers, each number S~i~ is the index of the supplier for the i-th member. S~root~ for the root supplier is defined to be -1. All the numbers in a line are separated by a space.

Output Specification:

For each test case, print in one line the highest price we can expect from some retailers, accurate up to 2 decimal places, and the number of retailers that sell at the highest price. There must be one space between the two numbers. It is guaranteed that the price will not exceed 10^10^.

Sample Input:

9 1.80 1.00
1 5 4 4 -1 4 5 3 6

Sample Output:

1.85 2

弄清楚题目的意思:给你一棵树,让你计算最大的层卖的价格(根节点为第0层),并输出最大层有几个。

样例解释:1.85 = 1.80 * (1 + 1.00%)^3  题目中输入的第一项的最后一个把百分号去掉了

#include <iostream>
#include <queue>
#include <stack>
#include <stdio.h>
#include <algorithm>
using namespace std;
const int maxn = 11e5;
struct Node
{
    vector<int> child;
    int layer;
    int w;
}node[maxn];

int main()
{
    int n,num,root;
    double price,rate;
    cin>>n>>price>>rate;
    rate = rate * 0.01;
    for(int i=0; i<n; i++)
    {
        cin>>num;
        if(num!=-1)
        {
            node[num].child.push_back(i);
        }
        if(num == -1)
        {
            root = i;
        }
    }
    node[root].layer = 0;
    queue<int> q;
    q.push(root);
    int maxlay = -1;
    int cnt = 0;
    while(!q.empty())
    {
        int now = q.front();
        q.pop();
        int len = node[now].child.size();
        if(node[now].layer > maxlay)
        {
            maxlay = node[now].layer;
            cnt = 0;
        }
        if(node[now].layer == maxlay)
        {
            cnt++;
        }
        for(int i=0; i<len; i++)
        {
            node[node[now].child[i]].layer = node[now].layer+1;
            q.push(node[now].child[i]);
        }
    }
    double p = 1+rate ;
    double r = 1;
    for(int i=0; i<maxlay; i++)
    {
        r = r*p;
    }
    printf("%.2f %d/n",r*price,cnt);

    return 0;
}

 

 

拜师教育学员文章:作者:1001-高同学, 转载或复制请以 超链接形式 并注明出处 拜师资源博客
原文地址:《1090 Highest Price in Supply Chain (25)(25 分)》 发布于2018-07-28

分享到:
赞(0) 打赏

评论 抢沙发

评论前必须登录!

  注册



长按图片转发给朋友

觉得文章有用就打赏一下文章作者

支付宝扫一扫打赏

微信扫一扫打赏

Vieu3.3主题
专业打造轻量级个人企业风格博客主题!专注于前端开发,全站响应式布局自适应模板。

登录

忘记密码 ?

您也可以使用第三方帐号快捷登录

Q Q 登 录
微 博 登 录