Total Sales of Supply Chain (25)

本文介绍了一个基于深度优先搜索算法的程序,该程序用于计算给定供应链中所有零售商的总销售额。供应链由零售商、分销商和供应商组成,从单一的根供应商开始,每个成员以一定百分比的价格增量购买和销售产品。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

题目描述

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.

输入描述:

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:
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.


输出描述:

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.

输入例子:

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

输出例子:

42.4
我的代码:

(类似题目:功夫传人(天梯赛)。使用算法:深度优先搜索)

#include<iostream>
#include<vector>
using namespace std;
int x,n,m,i,a[100001];
double y,z,sum=0;
vector<int>v[100001];
void money(int x,double y)
{
	int i;
	if(a[x]!=0) sum=sum+y*a[x];
	else
	{
		for(i=0;i<v[x].size();i++)
			money(v[x][i],y*(1.0+z/100.0));
	}
}
int main()
{
	cin>>x>>y>>z;
	for(i=0;i<x;i++)
	{
		cin>>n;
		if(n!=0)
		{
			while(n--)
			{
				cin>>m;
				v[i].push_back(m);
			}
		}
		else cin>>a[i];
	}
	money(0,y);
	printf("%.1f\n",sum);
	return 0;
}
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值