PAT甲级1004Counting Leaves

 题目地址：

编程题 - PAT (Advanced Level) Practice (pintia.cn)

介绍

计算每个层级中的叶子节点数，叶子节点指的是没有子节点的节点。

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.

代码

#include<bits/stdc++.h>
using namespace std;
struct NODE
{
	int level=0;
	bool son=0;
	int live=0;
}node[101];
int main()
{
	int n,m;
	cin>>n>>m;
    if(n==1)
    {
        cout<<1;
        return 0;
    }
	int level[101];
	memset(level,0,sizeof(level));
	int a1,a2,a3;
	for(int i=1;i<=m;++i)
	{
		cin>>a1>>a2;
		if(a2>=1)
		{
			node[a1].son=1;
			node[a1].level=1;
		}
		for(int j=1;j<=a2;j++)
		{
			cin>>a3;
            node[a3].live=a1;
			node[a3].level=1;
		}	
	}
	for(int i=1;i<=99;i++)
	{
		for(int j=1;j<=99;j++)
		{
			if(node[j].live==i)
			{
				node[j].level=node[i].level+1;
			}
		}
	 } 
	for(int i=1;i<=99;i++)
	{
		for(int j=1;j<=99;j++)
		{
			if(node[j].live==i)
			{
				node[j].level=node[i].level+1;
			}
		}
	 } 
	int max_level=-1;
	for(int i=1;i<100;i++)
	{
		if(!node[i].son&&node[i].level)
		{
			level[node[i].level]++;
			max_level=max(max_level,node[i].level);
		}
	}
	
	
	for(int i=1;i<max_level;i++)
	{
		cout<<level[i]<<" "; 
	}
    cout<<level[max_level];
	return 0;
 }