PAT 甲级 1004

1. 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

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

# 解题思路
# 先根据读取的内容建树，这个树不是严格意义上的树，只需要把每个非叶节点的内容存到一个字典或者数组中。理论上知道根，就能遍历整棵树
# tmap是记录非叶节点的的字典
# 建完树后从根开始用深度优先搜索遍历，深度记录在record数组中
# 打印的思路，首先N-M可以得到叶子节点的数量
# 从低往高遍历record，累计，到累计值为叶子节点数量时，停止循环
record = [0 for i in range(101)]
tmap = {}

def dfs(id, level):
    if not id in tmap:
        record[level] += 1
        return
    for cid in tmap[id]:
        dfs(cid,level+1)

if __name__ == '__main__':
    N,M = map(int, input().split())
    for i in range(M):
        line = input().split() # 读取数据

        rid = int(line[0])
        K = int(line[1])

        tmap[rid] = []

        for cid in line[2:]:
            cid = int(cid)
            tmap[rid].append(cid)

    dfs(1,0)

    cnt = record[0]
    cle = N-M
    result = str(record[0])
    for i in range(1,101):
        if cnt >= cle:
            break
        result += " " + str(record[i])
        cnt += record[i]

    print(result)