PAT甲级1004

最新推荐文章于 2021-05-31 19:06:58 发布

qq_36317016

最新推荐文章于 2021-05-31 19:06:58 发布

阅读量227

点赞数 1

CC 4.0 BY-SA版权

分类专栏： PAT

本文链接：https://blog.youkuaiyun.com/qq_36317016/article/details/79244407

PAT 专栏收录该内容

15 篇文章

订阅专栏

1004. Counting Leaves (30)
时间限制
400 ms
内存限制
65536 kB
代码长度限制
16000 B
判题程序
Standard
作者
CHEN, Yue
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

以上是题目

以下是代码，用了一个dfs遍历整个数找叶子节点

#include<iostream>
#include<vector>
#include<cstdio>

using namespace
std;

int depth_max = 
0;

void dfs(int i ,
int depth ,vector<int>*a,int*b ){
    if(a[i].size()==0){
b[depth]++;
        if(depth > depth_max)
            depth_max = depth;
        return;
    }
    for(vector<int>::iterator j = a[i].begin();j!=a[i].end();j++)
        dfs(*j,depth+1,a,b);
}

int main(){
    int N,M;
    int id,k,id_son;
    vector<int>a[100];
    int b[100]={0};
cin >> N >> M;
    getchar();
    for(int i=0;i<M;i++){
        cin >> id >> k;
        for(int j=0;j<k;j++){
cin >> id_son;
a[id].push_back(id_son);
        }
    }
    dfs(1,0,a,b);
    cout << b[0];
    for(int i=1;i<=depth_max;i++)
        cout<<" "<<b[i];
    cout<<endl;
    return 0;
}