a1004 Counting Leaves （DFS）

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 <iostream>
#include "vector"
using namespace std;
int MIN=-1,nums[100];
vector<int> person[100];
void DFS(int root,int depth){
    if (person[root].size() == 0){
        nums[depth] ++;
        MIN = max(MIN,depth);
        return;
    }
    for (int i = 0; i < person[root].size(); ++i) {
        DFS(person[root][i],depth+1);
    }
}
int main() {
    int n,m;
    cin>>n>>m;
    int a,b,c;
    for (int i = 0; i < m; ++i) {
        cin>>a>>b;
        for (int j = 0; j < b; ++j) {
            cin>>c;
            person[a].push_back(c);
        }
    }
    DFS(1,0);
    printf("%d",nums[0]);
    for (int i = 1; i <= MIN; ++i) {
        printf(" %d",nums[i]);
    }
}