1004 Counting Leaves

最新推荐文章于 2023-02-10 16:00:21 发布

暖i

最新推荐文章于 2023-02-10 16:00:21 发布

阅读量78

点赞数

分类专栏： pat甲级树

本文链接：https://blog.csdn.net/weixin_44270812/article/details/102885138

版权

pat甲级同时被 2 个专栏收录

45 篇文章 0 订阅

订阅专栏

树

18 篇文章 0 订阅

订阅专栏

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

hierarchy 英[ˈhaɪərɑːki]
美[ˈhaɪərɑːrki]
n. 等级制度(尤指社会或组织); 统治集团; 层次体系;

pedigree 英[ˈpedɪɡriː]
美[ˈpedɪɡriː]
n. 动物血统记录; 动物纯种系谱; 家谱; 门第; 世系; 起源;
adj. 优良品种的; 纯种的;

不难，唯一注意的是要考虑只有根节点的时候，也不是要考虑。。这题正常写就不会出什么问题

#include<iostream>
#include<cstdio>
#include<queue>
#include<vector>
#include<cmath>
const int maxn=105;
using namespace std;
int n,m,bk[maxn],maxx=1;
vector<int> v[maxn];
void dfs(int root,int depth){
	if(!v[root].size()){
		bk[depth]++;
	}
	if(maxx < depth) maxx=depth;
	for(int i=0;i<v[root].size();i++){
		dfs(v[root][i],depth+1);
	}
}
int main(){
	cin>>n>>m;
	for(int i=0;i<m;i++){
		int p,k;
		cin>>p>>k;
		while(k--){
			int a;
			cin>>a;
			v[p].push_back(a);
		}
	}
	dfs(1,1);
	for(int i=1;i<=maxx;i++){
		if(i<maxx) cout<<bk[i]<<' ';
		else cout<<bk[i];
	}
	return 0;
}