1004 Counting Leaves

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

#include <bits/stdc++.h>
using namespace std;
vector<int> tree[200];
queue<int>que;
int layer[200],tj[200],mmax=1;

int main(){
    int n,m;
    cin>>n>>m;
    for(int i=0;i<m;i++){
        int node,t,it;
        cin>>node>>t;
        for(int j=0;j<t;j++){
            cin>>it;
            tree[node].push_back(it);
        }
    }
     layer[1]=1;
       que.push(1);
    if(tree[1].size()==0)tj[1]++;
       while (!que.empty()) {
           int it = que.front();
           que.pop();
           for(int i=0;i<tree[it].size();i++){
               que.push(tree[it][i]);
               layer[tree[it][i]]=layer[it]+1;
               if(layer[tree[it][i]]>mmax)mmax=layer[tree[it][i]];
               if(tree[tree[it][i]].size()==0)tj[layer[it]+1]++;
           }
       }
    for(int i=1;i<=mmax;i++)
        if(i!=mmax)cout<<tj[i]<<" ";
        else cout<<tj[i];
    return 0;
}