PAT甲级 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

结尾无空行

思路：DFS

#include <bits/stdc++.h>
using namespace std;
const int maxv=110;
int n,m,maxdepth=-1;
vector<int> parent[maxv];
int depth[maxv]={0};
bool vis[maxv]={false};
void DFS(int root,int deep)
{
    vis[root]=true;
    if(parent[root].size()==0)
    {
        depth[deep]++;
        maxdepth=max(maxdepth,deep);
        return;
    }
    for(int i=0;i<parent[root].size();i++)
    {
        if(!vis[parent[root][i]]) DFS(parent[root][i],deep+1);
    }
}
int main()
{
    scanf("%d %d",&n,&m);
    for(int i=0;i<m;i++)
    {
        int a,cnt,b;
        scanf("%d %d",&a,&cnt);
        for(int j=0;j<cnt;j++)
        {
            scanf("%d",&b);
            parent[a].push_back(b);
        }
    }
    DFS(1,0);
    if(maxdepth==-1)
    {
        printf("0");
        return 0;
    }
    for(int i=0;i<=maxdepth;i++)
    {
        printf("%d",depth[i]);
        if(i!=maxdepth) printf(" ");
    }
    return 0;
}