PAT 甲级 1004 Counting Leaves

PAT 甲级 1004 Counting Leaves

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
结尾无空行

题意描述：

给定N个节点和M个父子节点关系，求每一层节点中有多少叶子节点。

解题思路：

很明显可以采用层序遍历来遍历这颗树，对于每个节点，判断其是否是叶子节点，然后用一个数组存储每一层的叶子节点个数即可。

难度评测：Middle Hard

AC代码实现：

#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
const int N = 105;
vector<int>v[N];
int cnt[N];

void bfs(int x, int &dep) {
	queue<P>q;
	q.push(P(x, dep));
	while(!q.empty()) {
		P tmp = q.front();
		q.pop();
		int u = tmp.first;
		int d = tmp.second;
		dep = max(dep, d);
		if(!v[u].size()) {
			cnt[dep]++;
			continue;
		}	
		for(auto ch : v[u]) {
			q.push(P(ch, d + 1));
		}
	}
}
int main() {
	int n, m;
	cin >> n >> m;
	while(m--) {
		int k, a ,b;
		cin >> a >> k;
		while(k--) {
			cin >> b;
			v[a].push_back(b);
		}
	}
	int dep = 1;
	bfs(1, dep);
	cout << cnt[1];
	for(int i = 2; i <= dep; i++)
		cout << " " << cnt[i];
}