pat1004 counting leaves

1004 Counting Leaves (30 分)

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

作者

CHEN, Yue

单位

浙江大学

1.先用map<string, vector<string>>保存父节点对应的孩子节点；

2.由于题目说确定01作为根节点，将01入队，用队列来做层序遍历，保存每一层的叶子节点个数；随后输出。

#include <stdio.h>
#include <cstring>
#include <iostream>
#include <queue>
#include <cctype>
#include <map>
#include <set>
#include <algorithm>
#include <iomanip>
#include <cstdlib>

using namespace std;

void countingLeaves(){
	int numOfNodes, numOfNonLeaf;
	while(cin>>numOfNodes>>numOfNonLeaf){
		map<string, vector<string>> pchilds;
		for(int  i = 0; i < numOfNonLeaf; i++){
			string val;
			int num;
			cin>>val>>num;
			vector<string> childs;
			for(int j = 0; j < num; j++){
				string str;
				cin>>str;
				childs.push_back(str);
			}
			pchilds.insert(make_pair(val, childs));//保存父节点对应的孩子
		}
		vector<int> levelChilds;
		queue<string> que;
		que.push("01");
		while(!que.empty()){
			int nodes = que.size();//每层节点数
			int leaf = 0;//叶子节点数
			for(int i = 0; i < nodes; i++){
				string val = que.front();
				if(pchilds.count(val)==0){
					leaf++;
				}else{//把下一层放在队列里
				    vector<string> kids = pchilds.at(val);//获取孩子
					for(int j = 0; j < kids.size(); j++){
						que.push(kids.at(j));//所有孩子入队
					}
				}
				que.pop();
			}
			levelChilds.push_back(leaf);//保存每一层的叶节点个数
		}
		for(int i = 0; i < levelChilds.size()-1; i++){
			cout<<levelChilds.at(i)<< " ";//输出
		}
		cout<<levelChilds.at(levelChilds.size()-1)<<endl;
	}
}

int main(){
	countingLeaves();
	return 0;
}