A1004. Counting Leaves

A family hierarchy is usually presented by a pedigree tree. Your job is to count those family members who have no child.

Input

Each input file contains one test case. Each case starts with a line containing 0 < N < 100, the number of nodes in a tree, and M (< N), the number of non-leaf nodes. Then M lines follow, each in the format:

ID K ID[1] ID[2] ... ID[K]

where ID is a two-digit number representing a given non-leaf node, K is the number of its children, followed by a sequence of two-digit ID's of its children. For the sake of simplicity, let us fix the root ID to be 01.

Output

For each test case, you are supposed to count those family members who have no child for every seniority level starting from the root. The numbers must be printed in a line, separated by a space, and there must be no extra space at the end of each line.

The sample case represents a tree with only 2 nodes, where 01 is the root and 02 is its only child. Hence on the root 01 level, there is 0 leaf node; and on the next level, there is 1 leaf node. Then we should output "0 1" in a line.

Sample Input

2 1
01 1 02

Sample Output

0 1

 1 #include<cstdio>
 2 #include<iostream>
 3 #include<algorithm>
 4 #include<vector>
 5 #include<queue>
 6 using namespace std;
 7 typedef struct NODE{
 8     vector<int>child;
 9     int layer;
10 }node;
11 node tree[101];
12 int N, M, cnt[101] = {0,0}, depth = -1;
13 void levelOrder(int root){
14     queue<int> Q;
15     tree[root].layer = 0;
16     Q.push(root);
17     while(Q.empty() == false){
18         int temp = Q.front();
19         if(tree[temp].layer > depth)
20             depth = tree[temp].layer;
21         Q.pop();
22         if(tree[temp].child.size() == 0){
23             cnt[tree[temp].layer]++;
24         }
25         int len = tree[temp].child.size();
26         for(int i = 0; i < len; i++){
27             tree[tree[temp].child[i]].layer = tree[temp].layer + 1;
28             Q.push(tree[temp].child[i]);
29         }
30     }
31 }
32 int main(){
33     int tempc, tempd, tempe;
34     scanf("%d%d", &N, &M);
35     for(int i = 0; i < M; i++){
36         scanf("%d%d", &tempc, &tempd);
37         for(int j = 0; j < tempd; j++){
38             scanf("%d",&tempe);
39             tree[tempc].child.push_back(tempe);
40         }
41     }
42     levelOrder(1);
43     for(int i = 0; i <= depth; i++){
44         if(i != depth)
45             printf("%d ", cnt[i]);
46         else printf("%d", cnt[i]);
47     }
48     cin >> N;
49     return 0;
50 }

View Code

总结：

1、题意：题目要求计算从根开始每一层的没有孩子的家庭成员。其实从题目上就知道，就是计算每一层的叶节点个数。

2、使用一个hash数组，以层数为下标索引。使用层序遍历来计算出每一个节点的层数。每次访问节点时，如果该节点没有子树，则将其所在layer的hash数组加一。