💟这里是CS大白话专场,让枯燥的学习变得有趣!
💟没有对象不要怕,我们new一个出来,每天对ta说不尽情话!
💟好记性不如烂键盘,自己总结不如收藏别人!
题目描述
A family hierarchy is usually presented by a pedigree tree. Your job is to count those family members who have no child.
输入描述:
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.
输出描述:
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.
输入例子:
2 1 01 1 02
输出例子:
0 1
#include <iostream>
#include <string>
#include <vector>
using namespace std;
vector<int>node[100];
int leaves[100];
int max_depth;
void dfs(int n, int depth){
if(node[n].size() == 0){
leaves[depth]++;
if(depth > max_depth) max_depth = depth;
return;
}
for(int i=0;i<node[n].size();i++){
dfs(node[n][i],depth+1);
}
}
int main(){
int N,M;
int m,K,id;
cin >> N >> M;
for(int i=0;i<M;i++){
cin >> m >> K;
for(int i=0;i<K;i++){
cin >> id;
node[m].push_back(id);
}
}
dfs(1,0);
cout << leaves[0];
for(int i=1; i<=max_depth; i++){
cout << ' ' << leaves[i];
}
return 0;
}