1004. Counting Leaves (30)
来源:互联网 发布:大连保险网络大学 编辑:程序博客网 时间:2024/05/16 09:52
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 childfor 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 Input2 101 1 02Sample Output
0 1
可以直接一遍DFS然后统计每一层没有孩子节点的个数。
#include <iostream>#include <cstdio>#include <vector>using namespace std;struct Node{vector<int> children;};void bfs(int id, int level, vector<int>& countLeaves, vector<Node>& family, vector<bool>& used){if((int)countLeaves.size() <= level){countLeaves.push_back(0);}if(family[id].children.empty()) ++countLeaves[level];for(size_t i = 0; i < family[id].children.size(); ++i){int j = family[id].children[i];if(!used[j]){used[j] = true;bfs(j, level + 1, countLeaves, family, used);}}}int main(){int n, m;scanf("%d%d", &n, &m);vector<Node> family(100);for(int i = 0; i < m; ++i){int id, k;scanf("%d%d", &id, &k);for(int j = 0; j < k; ++j){int idk;scanf("%d", &idk);family[id].children.push_back(idk);}}vector<int> countLeaves;vector<bool> used(100, false);bfs(1, 0, countLeaves, family, used);bool first = true;for(auto& n : countLeaves){if(first) first = false;else printf(" ");printf("%d", n);}return 0;}
- 1004. Counting Leaves (30)
- 1004. Counting Leaves (30)
- 1004. Counting Leaves (30)
- 1004. Counting Leaves (30)
- 1004. Counting Leaves (30)
- 1004. Counting Leaves (30)
- 1004. Counting Leaves (30)
- 1004. Counting Leaves (30)
- 1004. Counting Leaves (30)
- 1004. Counting Leaves (30)
- 1004. Counting Leaves (30)
- 1004. Counting Leaves (30)
- 1004. Counting Leaves (30)
- 1004. Counting Leaves (30)
- 1004. Counting Leaves (30)
- 1004. Counting Leaves (30)
- 1004. Counting Leaves (30)
- 1004. Counting Leaves (30)
- androidpadding和androidmargin的区别
- 1077. Kuchiguse (20)
- 算法学习--回朔和剪枝
- Big String-POJ2887块状数组
- 【模板】前向星+树链剖分+线段树
- 1004. Counting Leaves (30)
- C++11的mutex和lock_guard,muduo的MutexLock 与MutexLockGuard
- PAT习题解:1022. Digital Library (30)
- adb被占用解决办法
- python中Matplotlib的坐标轴的坐标区间的设定
- 单例的两种实现方式
- Learn Unity - Scripts(新手教程)
- 第十二章编程练习(3)
- 和为S的连续正数序列