PAT 甲级1004 Counting Leaves （30 分)

1004 Counting Leaves （30 分)

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

Input Specification:

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.

The input ends with N being 0. That case must NOT be processed.

Output Specification:

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

 

题目大意：

  给定一个族谱要求统计每一代人没有孩子的人数。第一行给定n（族谱的人数）与m（非叶子结点的个数）。接下来m行 按照以下格式输入 id（父结点的编号） k（孩子结点的个数） 与k个孩子结点的编号。

  输出每一代人没有孩子的人数。

思路：

  用dfs + hashtable ， 每次遍历如果当前结点没有孩子结点则hashtable[depth]++,表示该代没有孩子的人数增加一个。

 

参考代码：

#include<vector>
#include<cstdio>
#include<algorithm>
using namespace std;
int maxdepth;
vector<int> cnt, tree[100];
void dfs(int v, int depth){
	if(tree[v].size() == 0){
		cnt[depth]++;
		maxdepth = max(maxdepth, depth);
		return;
	}
	for(int i = 0; i < tree[v].size(); ++i)	dfs(tree[v][i], depth + 1);
}
int main(){
	int n, m, k, id;
	scanf("%d%d", &n, &m);
	cnt.resize(n + 1);
	for(int i = 0; i < m; ++i){
		scanf("%d%d", &id, &k);
		tree[id].resize(k);
		for(int j = 0; j < k; ++j)	scanf("%d", &tree[id][j]);
	}
	dfs(1, 1);
	printf("%d", cnt[1]);
	for(int i = 2; i <= maxdepth; ++i)	printf(" %d", cnt[i]);
	return 0;
}