pat 1004 Counting Leaves

最新推荐文章于 2022-07-26 16:28:25 发布

原创最新推荐文章于 2022-07-26 16:28:25 发布 · 421 阅读

0 ·

CC 4.0 BY-SA版权

PAT 专栏收录该内容

36 篇文章

订阅专栏

本文介绍了一个算法问题，即如何通过遍历家族树（以树形结构表示的家庭成员关系）来计算每个层级上没有子女的家庭成员数量。文章提供了一段C++代码示例，演示了如何实现这一功能。

A family hierarchy is usually presented by a pedigree tree. Your job is to count those family members who have no child.

Input

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.

Output

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 <iostream>
#include <cstdio>
#include <vector>
#include <map>
#include <queue>
using namespace std;

#define N 110

vector<vector<int> > tree(N);
vector<int> leaf(N,0);
map<int, vector<int> > levels;

void dfs(int node, int level) {
	//levels[level].push_back(node);

	if(tree[node].empty()) {
		levels[level].push_back(node);
		return;
	}

	for(int i = 0; i < tree[node].size(); i++) {
		dfs(tree[node][i], level+1);
	}

}
int main() {
	int n, m;
	scanf("%d %d", &n, &m);

	for(int i = 1; i <= m; i++) {
		int index, cnt, node;
		scanf("%d %d", &index, &cnt);

		if(cnt == 0) continue;
		else leaf[index] = cnt;

		for(int j = 1; j <= cnt; j++) {
			scanf("%d", &node);
			tree[index].push_back(node);
		}
	}

	dfs(1, 1);

	map<int, vector<int> >::iterator iter;
	vector<int> ans(N,0);
	int maxx = -1;

	for(iter = levels.begin(); iter != levels.end(); iter++) {
		int tmp = iter->first;
		vector<int> vec = iter->second;
		
		if(tmp > maxx) maxx = tmp;

		if(vec.empty())
			ans[tmp] = 0;
		else
			ans[tmp] = vec.size();
	}

	for(int i = 1; i <= maxx; i++) {
		if(i == 1) printf("%d", ans[i]);
		else printf(" %d", ans[i]);
	}
	printf("\n");
	return 0;
}