PAT A1106 Lowest Price in Supply Chain （25 分）——树的bfs遍历

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

 #include <stdio.h>
 #include <algorithm>
 #include <set>
 #include <string.h>
 #include <vector>
 #include <math.h>
 #include <queue>
 using namespace std;
 const int maxn = ;
 int n;
 double p,r;
 vector<int> res[maxn];
 int num=,lvl=;
 void bfs(int root){
     queue<int> q;
     q.push(root);
     int flag=;
     while(!q.empty()){
         queue<int> tmp;
         while(!q.empty()){
             int now = q.front();
             q.pop();
             if(res[now].empty()){
                 num++;
                 flag=;
             }
             for(int i=;i<res[now].size();i++){
                 tmp.push(res[now][i]);
             }
         }
         if(flag)break;
         while(!tmp.empty()){
             q.push(tmp.front());
             tmp.pop();
         }
         lvl++;
     }
 }
 int main(){
     scanf("%d %lf %lf",&n,&p,&r);
     int i;
     for(i=;i<n;i++){
         int k;
         scanf("%d",&k);
         for(int j=;j<k;j++){
             int x;
             scanf("%d",&x);
             res[i].push_back(x);
         }
     }
     bfs();
     p=p*pow((+r/),lvl);
     //printf("%d",lvl);
     printf("%.4f %d",p,num);
 }

注意点：bfs遍历要一层一层保存和入队，用正常的一个队列进行bfs会出现不该入队的元素入队，导致结果错误。例如原本第二层会到达终点，但队列里的第二层元素不是第一个元素就到达终点了，而是后面几个，这样第一个元素的子节点也已经入队，此时如果子节点也到了终点就会多算。