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
结尾无空行
Answer:
BFS,搜索每一层的叶结点统计即可
#include<bits/stdc++.h>
#define maxn 1050
using namespace std;
vector<int> son[105];
int level[105];
int maxm=-999;
void bfs(int root,int nowlevel){
maxm=max(maxm,nowlevel);
if(son[root].empty())level[nowlevel]++;
for(int i=0;i<son[root].size();i++){
bfs(son[root][i],nowlevel+1);
}
return;
}
int main(){
int N,M;
cin>>N>>M;
for(int i=1;i<=M;i++){
char _in[5];
cin>>_in;
int nfat=atoi(_in);
int k;
cin>>k;
for(int j=1;j<=k;j++){
cin>>_in;
int nson=atoi(_in);
son[nfat].push_back(nson);
}
}
bfs(1,1);
printf("%d",level[1]);
for(int i=2;i<=maxm;i++){
printf(" %d",level[i]);
}
}