1079 Total Sales of Supply Chain-PAT甲级

题目描述

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

树的遍历，从父节点开始。利用vector数组的形式

关于inner_product函数的介绍如下：‘

 

来源：inner_product是c++标准库封装的一个函数。

函数原型：inner_product(beg1, end1, beg2, init)

inner_product(beg1, end1, beg2, init, BinOp1, BinOp2)

函数介绍：

返回作为两个序列乘积而生成的元素的总和。步调一致地检查两个序列,将

来自两个序列的元素相乘,将相乘的结果求和。由 init 指定和的初值。假定从

beg2 开始的第二个序列具有至少与第一个序列一样多的元素,忽略第二个序列

中超出第一个序列长度的任何元素。init 的类型决定返回类型。

第一个版本使用元素的乘操作符(*)和加操作符(+):给定两个序列 2,3,5,8

和 1,2,3,4,5,6,7,结果是初值加上下面的乘积对:

initial_value + (2 * 1) + (3 * 2) + (5 * 3) + (8 * 4)

如果提供初值 0,则结果是 55。

第二个版本应用指定的二元操作,使用第一个操作代替加而第二个操作代替

乘。作为例子,可以使用 inner_product 来产生以括号括住的元素的名-值对

的列表,这里从第一个输入序列获得名字,从第二个序列中获得对应的值:

// combine elements into a parenthesized, comma-separated pair

string combine(string x, string y)

{

return "(" + x + ", " + y + ")";

}

// add two strings, each separated by a comma

string concatenate(string x, string y)

{

if (x.empty())

return y;

return x + ", " + y;

}

cout << inner_product(names.begin(), names.end(),

values.begin(), string(),

concatenate, combine);

如果第一个序列包含 if、

string 和 sort,

且第二个序列包含 keyword、

library

type 和 algorithm,则输出将是

(if, keyword), (string, library type), (sort, algorithm)

两种解法：

满分代码如下：dfs

#include<bits/stdc++.h>
using namespace std;
const int N=100010;
int sum[N];
double price[N];
vector<int>ve[N];
int n;
double p,r;
void dfs(int v){
	for(int i:ve[v]){
		price[i]=price[v]*(1+r/100);
		dfs(i);
	}
}
int main(){
	//ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	cin>>n>>p>>r;
	price[0]=p;
	int num,id;
	for(int i=0;i<n;i++){
		cin>>num;
		if(num==0){
			cin>>id;
			sum[i]=id;
		}else{
			for(int j=0;j<num;j++){
				cin>>id;
				ve[i].push_back(id);
			}
		}
	}
	double cnt=0;
	for(int i=0;i<n;i++){
		if(sum[i]>0){
			cnt+=(sum[i]*price[i]);
		}
	}
	dfs(0);
	cnt=inner_product(price,price+n,sum,0.0);
	printf("%.1f\n",cnt);
	return 0;
}

满分代码如下：bfs

#include<bits/stdc++.h>
using namespace std;
const int N=100010;
int sum[N];
double price[N];
vector<int>ve[N];
int n;
double p,r;
void bfs(int v){
	queue<int>q;
	q.push(v);
	while(!q.empty()){
		int t=q.front();
		q.pop();
		for(int i:ve[t]){
			price[i]=price[t]*(1+r/100);
			q.push(i);
		}
	}
}
int main(){
	//ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	cin>>n>>p>>r;
	price[0]=p;
	int num,id;
	for(int i=0;i<n;i++){
		cin>>num;
		if(num==0){
			cin>>id;
			sum[i]=id;
		}else{
			for(int j=0;j<num;j++){
				cin>>id;
				ve[i].push_back(id);
			}
		}
	}
	double cnt=0;
	for(int i=0;i<n;i++){
		if(sum[i]>0){
			cnt+=(sum[i]*price[i]);
		}
	}
	bfs(0);
	cnt=inner_product(price,price+n,sum,0.0);
	printf("%.1f\n",cnt);
	return 0;
}