1004 Counting Leaves

最新推荐文章于 2024-09-11 06:30:00 发布

Aurora2005

最新推荐文章于 2024-09-11 06:30:00 发布

阅读量501

点赞数 15

分类专栏： PAT甲级文章标签：开发语言 c++

本文链接：https://blog.csdn.net/2301_80161204/article/details/141028616

版权

PAT甲级专栏收录该内容

11 篇文章 0 订阅

订阅专栏

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

代码长度限制

16 KB

时间限制

400 ms

内存限制

64 MB

栈限制

8192 KB

#include <iostream>
#include <vector>
using namespace std;

int N,M,maxlevel,num_of_eachlevel[100]={0};
vector<int>child[100];

void dfs(int curID,int curlevel){
    if(curlevel>maxlevel)maxlevel=curlevel;
    if(child[curID].size()>0){
        for(auto x:child[curID]){
            dfs(x,curlevel+1);
        }
    }
    else{
        num_of_eachlevel[curlevel]++;
    }
}

int main()
{
    cin>>N>>M;
    for(int i=0;i<M;i++){
        int ID,K,j;
        cin>>ID>>K;
        while(K--){
            cin>>j;
            child[ID].push_back(j);
        }
    }
    dfs(1,1);
    for(int i=1;i<=maxlevel;i++){
        if(i>1)cout<<' ';
        cout<<num_of_eachlevel[i];
    }
    return 0;
}