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<stdio.h>
#include<vector>
#include<queue>
using namespace std;
vector<int> tree[105];
int main(){
int n,m;
scanf("%d%d",&n,&m);
for(int i=0;i<m;i++){
int id,k,tmp;
scanf("%d %d",&id,&k);
for(int j=0;j<k;j++){
scanf("%d",&tmp);
tree[id].push_back(tmp);
}
}
queue<int> q;
q.push(1);
int begin=1,leaf=0;bool pre=false,first=true;
while(!q.empty()){
int t=q.front();
q.pop();
if(t==begin){
if(t!=1){
if(!first)printf(" ");
else first=false;
printf("%d",leaf);
}leaf=0;pre=true;
}
if(tree[t].size()==0)
leaf++;
for(int i=0;i<tree[t].size();i++){
if(pre){
begin=tree[t][i];
pre=false;
}
q.push(tree[t][i]);
}
}
if(n!=1)printf(" ");
printf("%d",leaf);
return 0;
}