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

作者  CHEN, Yue   单位  浙江大学

代码长度限制    16 KB

时间限制  400 ms

内存限制  64 MB

题意：首先输入两个数n,m，n表示总共有多少节点 ，m表示接下来有多少行

每行第一个数ID，表示父节点，第二个数K，表示ID有几个孩子，然后是K个数表示K的孩子。

题目要求计算树的每一层 没儿子的节点 的个数。

 

#include <bits/stdc++.h>
using namespace std;
struct node
{
    vector<int> kids;
} father[105];
int level[105], maxlen = -1;
void dfs(int cur, int step)
{
    if (father[cur].kids.empty())
    {
        maxlen = max(maxlen, step);
        level[step]++;
        return;
    }

    for (int i = 0; i < father[cur].kids.size(); i++)
    {
        dfs(father[cur].kids[i], step + 1);
    }
}
int main()
{
    int n, m;
    scanf("%d %d", &n, &m);
    for (int i = 0; i < m; i++)
    {
        int id, k;
        scanf("%d %d", &id, &k);
        while (k--)
        {
            int t;
            scanf("%d", &t);
            father[id].kids.push_back(t);
        }
    }
    dfs(01, 1);
    for (int i = 1; i <= maxlen; i++)
    {
        printf(i == maxlen ? "%d\n" : "%d ", level[i]);
    }
}