1004. Counting Leaves (30)
2016-03-09 15:25
281 查看
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
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
使用广度优先搜索来对树的每一层节点进行遍历。
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
使用广度优先搜索来对树的每一层节点进行遍历。
[code]#include <iostream> #include <map> #include <vector> #include <queue> using namespace std; map<int, vector<int> > adjacent; vector<int> bfs(int id); int main() { int n,m,id,k,sid; cin >>n >>m; for(int i=0;i<m;i++) { cin >>id >>k; for(int j=0;j<k;j++) { cin >>sid; adjacent[id].push_back(sid); } } vector <int> cnt; cnt=bfs(1); vector <int>::iterator iter=cnt.begin(); cout <<*iter; iter++; for(;iter!=cnt.end();iter++) cout <<" " <<*iter; cout <<endl; return 0; } vector<int> bfs(int id) { queue <int> q; q.push(id); int cnt,cnt_none_child=0; int tmp_id; vector<int> record; while(!q.empty())//每一次循环,处理某一层的所有节点 { cnt=q.size(); for(int i=0;i<cnt;i++) { tmp_id=q.front(); q.pop(); if(!adjacent[tmp_id].empty()) { vector<int>::iterator iter=adjacent[tmp_id].begin(); for(;iter!=adjacent[tmp_id].end();iter++) q.push(*iter); } else cnt_none_child++; } record.push_back(cnt_none_child); cnt_none_child=0; } return record; }
相关文章推荐
- andriod 动态显示当前时间
- Postman -- HTTP请求的Chrome插件
- 7.xmpp版即时聊天
- javacript基础2
- zookeeper环境搭建中的几个坑[Error contacting service. It is probably not running]的分析及解决
- PageRank算法和HITS算法
- Ubuntu 15.10下的WebStorm-11.0.3完美破解
- 蓝桥杯 历届试题 剪格子(dfs搜索)
- bzoj 3270: 博物馆
- Ubuntu 15.10下的WebStorm-11.0.3完美破解
- 更简单的非递归遍历二叉树的方法
- 前端模块化,AMD与CMD的区别
- ERROR YarnScheduler: Lost executor
- Android Studio 错误:找不到符号
- 黑马程序员-Java IO和装饰设计模式
- Android 吸入动画效果详解
- BZOJ 3110 ZJOI 2013 K大数查询 树套树(权值线段树套区间线段树)
- 装饰器
- 时间片轮转代码中的汇编代码分析
- java数字前补0