PAT甲级1106

PAT甲级1106

题目:
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 lowest price a customer 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 their ID’s are numbered from 0 to N−1, and the root supplier’s ID is 0); P, the 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. All the numbers in a line are separated by a space.

Output Specification:
For each test case, print in one line the lowest price we can expect from some retailers, accurate up to 4 decimal places, and the number of retailers that sell at the lowest price. There must be one space between the two numbers. It is guaranteed that the all the prices will not exceed 10
​10
​​ .

Sample Input:
10 1.80 1.00
3 2 3 5
1 9
1 4
1 7
0
2 6 1
1 8
0
0
0
Sample Output:
1.8362 2

题目大意:n总结点,p出厂价,r为每加一层价格提高的比率(记得除以100),根节点为0,给出n行数据,第i行代表第i-1个节点的孩子数,若为0则代表叶节点,求顾客能买到产品的最低价和最低价的总零售商数。依然是道简单的DFS遍历,全局定义一个节点数组和最低价,依次深度往下寻找,若找到比最低价更低的价格则覆盖掉原来的最低价,并且置cnt为1,之后若找到同样的最低价则让cnt+1。这里可以再设置个全局变量level来记录最低价所在的层数,之后可以通过砍掉比level更高层数的节点来剪枝,不用比较(博主懒得加了,反正都不会超时)。
这题也可以用BFS,node结构体中增加height变量,记录每个节点所在的层数,然后依次进队,碰到第一个没有孩子的节点就是要找的最低价,然后继续寻找同一层的节点数就可以。但是考虑到一开始录入的时候要做两轮循环记录高度就懒得用了(懒癌晚期)。
只要能读懂题目都不难,我觉得这更偏向于阅读理解…

#include <iostream>
#include <vector>
#include <math.h>
using namespace std;

struct node{
	vector<int> child;
};
double p,r;
double lowest=10000000000;
int cnt=0;
node nd[100000];
void DFS(int index,int height){
	if(nd[index].child.size()==0){
		double sum=p*pow((1+r),height-1);
		if(lowest>sum){
			lowest=sum;
			cnt=1;
		}else if(lowest==sum){
			cnt++;
		}
		return ;
	}
	for(int i=0;i<nd[index].child.size();i++){
		DFS(nd[index].child[i],height+1);
	}
}
int main(){
	int n,tmp,ch;
	scanf("%d%lf%lf",&n,&p,&r);
	r/=100;
	for(int i=0;i<n;i++){
		scanf("%d",&tmp);
		for(int j=0;j<tmp;j++){
			scanf("%d",&ch);
			nd[i].child.push_back(ch);
		}
	}
	DFS(0,1);
	printf("%.4f %d",lowest,cnt);
	system("pause");
	return 0;
}
已标记关键词 清除标记
相关推荐
©️2020 CSDN 皮肤主题: 大白 设计师:CSDN官方博客 返回首页