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 (≤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 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. 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 1010.
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
总结:
- 数的遍历很类似,但是本题遇到了赋值问题,搞了好久,需要注意。就是整体变量初值设定的问题,脑子有点短路
- 代码模式也是类似:设置边界——DFS递归
代码:
#include <stdio.h>
#include <vector>
#include <math.h>
#include <algorithm>
using namespace std;
double price,r;
const int maxn=100010;
int total,ans,ldepth=maxn; //记录最浅深度,卡了20分钟
struct Node{
int layer;
vector<int> child;
}node[maxn];
void DFS(int index,int depth){
node[index].layer=depth;
if(node[index].child.size()==0){ //设置边界
if(node[index].layer==ldepth){ //深度相同就++
ans++;
}
if(node[index].layer<ldepth){
ans=1;
ldepth=depth;
}
return;
}
for(int i=0;i<node[index].child.size();i++){
int child=node[index].child[i];
DFS(child,depth+1);
}
}
int main(){
scanf("%d %lf %lf",&total,&price,&r);
r /= 100;
int childNum,child;
for(int i=0;i<total;i++){
scanf("%d",&childNum);
for(int j=0;j<childNum;j++){
scanf("%d",&child);
node[i].child.push_back(child);
}
}
DFS(0,0); //插入根结点编号、初始深度
printf("%.4f %d",price*pow(r+1,ldepth),ans); //自动四舍五入
return 0;
}