PAT.A1004 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

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>																							
#include<vector>
#include<queue>
#include<cstring>
#include<stack>
using namespace std;
const int maxn = 110;
int n, m, id, k,child,leaf[maxn],layer[maxn],md=0;
vector<int> node[maxn];
void bfs2() {
	int level = 1,first=0,last=1,rear=0;
	queue<int> q;
	q.push(1);
	rear++;
	while (!q.empty()) {
		int f = q.front();
		q.pop();
		first++;
		if (node[f].size() == 0) {
			leaf[level]++;
			if (level > md) md = level;
		}
		for (int i = 0; i < node[f].size(); i++) {
			q.push(node[f][i]);
			rear++;
		}
		if (first == last) {
			last = rear;
			level++;
		}
	}
}
void bfs() {
	queue<int> q;
	q.push(1);
	layer[1] = 1;
	while (!q.empty()) {
		int f = q.front();
		q.pop();
		if (layer[f] > md) {
			md = layer[f];
		}
		if (node[f].size() == 0) {
			leaf[layer[f]]++;
		}
		for (int i = 0; i < node[f].size(); i++) {
			q.push(node[f][i]);
			layer[node[f][i]] = layer[f] + 1;
		}
	}
}
void dfs(int root,int depth) {
	if (node[root].size() == 0) {
		leaf[depth]++;
		if (depth > md) md = depth;
		return;
	}
	for (int i = 0; i < node[root].size(); i++)
		dfs(node[root][i], depth + 1);
}
int main() {
	scanf("%d%d", &n, &m);
	memset(leaf, 0, sizeof(leaf));
	memset(layer, 0, sizeof(layer));
	for (int i = 0; i < m; i++) {
		scanf("%d%d", &id,&k);
		for (int j = 0; j < k; j++) {
			scanf("%d", &child);
			node[id].push_back(child);
		}
	}
	bfs2();
	//bfs();
	//dfs(1, 1);
	for (int i = 1; i <=md; i++) {
		printf("%d",leaf[i]);
		if (i < md) printf(" ");
	}
	return 0;
}