甲级PAT 1079 Total Sales of Supply Chain （25 分）(bfs)

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 (≤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

参考代码 

#include<bits/stdc++.h>
using namespace std;

struct Node{
	vector<int> v;
}chain[100010];

int n;
double p,r;
int retail[100010];


double bfs(int x){
	queue<int> q;
	q.push(x);
	int level=0,last=x,nextlast;
	double scale=p,sum=0;
	while(!q.empty()){
		int top=q.front();
		if(retail[top]>0){
			sum+=scale*retail[top];
		}
		q.pop();
		for(int i=0;i<chain[top].v.size();i++){
			int temp = chain[top].v[i];
			q.push(temp);
			nextlast=temp;	
		}
		if(last==top){
			scale=scale*(1+r);
			last=nextlast;
		}
	}
	return sum;
}

int main(){
	int i,j,k,t;
	cin>>n>>p>>r;
	r=r/100;
	for(i=0;i<n;i++){
		cin>>k;
		if(k==0){
			cin>>retail[i];
		}else{
			for(j=0;j<k;j++){
				cin>>t;
				chain[i].v.push_back(t);
			}
		}
	}
	printf("%.1f",bfs(0));
	return 0;
}

性能

2020.8.22

使用dfs

//10.22-10.45 终于把题目意思理解清楚了
//10.45-11.01 一遍AC 
 
#include<bits/stdc++.h>
using namespace std;
double P,r;

vector<vector<int> >child;
map<int,int> amount;
double sum=0;

void dfs(int root,int level){
	int cnum=child[root].size();
	if(cnum==0){
		sum+=P*pow(1.0+0.01*r,level)*amount[root];
		return;
	}
	for(int i=0;i<cnum;i++){
		int k=child[root][i];
		dfs(k,level+1);
	}
}

int main(){
	int N,k,id,n;
	cin>>N>>P>>r;
	child.resize(N);
	for(int i=0;i<N;i++){
		cin>>k;
		for(int j=0;j<k;j++){
			cin>>id;
			child[i].push_back(id);
		}
		if(k==0){
			cin>>n;
			amount[i]=n;
		}
	}
	dfs(0,0);
	cout<<fixed<<setprecision(1)<<sum<<endl;	
	return 0;
} 

性能:

修改：零售商售出的数量不用一维数组而用map存储，在数据少的时候减少了内存，但是似乎总体内存仍然占据很大==还是乖乖用一维数组把，修改之后

发现内存还用的很多，因为dfs采用递归递归次数多则占内存可能非常大，bfs占用内存非常平均，该题用dfs还是bfs在时间上差别不大