PTA甲级 1004 Counting Leaves (C++)

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

Solution:

// Talk is cheap, show me the code
// Created by Misdirection 2021-09-02 10:55:14
// All rights reserved.

#include <iostream>
#include <vector>
#include <queue>

using namespace std;

int n, m;
vector<vector<int>> children;

int main(){
    
    scanf("%d %d", &n, &m);
    children.resize(n + 1);

    for(int i = 0; i < m; ++i){
        int id, num;
        scanf("%d %d", &id, &num);

        for(int j = 0; j < num; ++j){
            int cID;
            scanf("%d", &cID);

            children[id].push_back(cID);
        }
    }

    queue<int> q;
    q.push(1);
    vector<int> levels;

    while(!q.empty()){
        int size = q.size();
        int cnt = 0;

        for(int i = 0; i < size; ++i){
            int tmp = q.front();
            q.pop();

            if(children[tmp].size() == 0) cnt++;
            else{
                for(int j = 0; j < children[tmp].size(); ++j) q.push(children[tmp][j]);
            }
        }

        levels.push_back(cnt);
    }

    for(int i = 0; i < levels.size(); ++i){
        if(i == levels.size() - 1) printf("%d\n", levels[i]);
        else printf("%d ", levels[i]);
    }

    return 0;
}