PAT甲级1004 （DFS，树的父子节点）

题目

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

题解

#include<iostream>
#include<vector>
using namespace std;
vector<int> v[100];
int book[100],maxlevel=-1;
void dfs(int root,int level){if(level>maxlevel){maxlevel=level;}if(v[root].size()==0){book[level]++;}else {for(int i=0;i<v[root].size();i++)dfs(v[root][i],level+1);}}int main(){int n,m,parent,k,child;scanf("%d %d",&n,&m);for(int i=0;i<m;i++){scanf("%d %d",&parent,&k);//少了一个%d导致错误for(int j=0;j<k;j++){scanf("%d",&child);v[parent].push_back(child);}}dfs(1,0);printf("%d",book[0]);for(int i=1;i<=maxlevel;i++)printf(" %d",book[i]);return 0;
}

不太懂DFS中的return写法，具体注释稍后加上。

PAT甲级1004 （DFS，树的父子节点）相关推荐

PAT甲级1004 Counting Leaves (30分)：[C++题解]树、邻接表存储树、dfs遍历树
文章目录题目分析题目链接题目分析题意重述:一棵树,求每一层的叶子节点数目. 分析构造树,使用邻接表来存(相当于存储有向图). 需要一个头结点数组h[N],然后每个头节点往外形成一个单链表e[ ...
关于树的父子节点的图形化展示
功能需求是实现树的父子节点的图形展示关系,且可以点击节点的时候,会相应地切换显示.因此网上寻找相关的插件来看看是不是满足需求.参考了许多的博客,感觉最有价值的就是这篇博客http://www.cnbl ...
【PAT - 甲级1004】Counting Leaves (30分) （dfs，递归）
题干: A family hierarchy is usually presented by a pedigree tree. Your job is to count those family me ...
PAT 甲级 1004
家谱统计题目思路: 本题其实不用建立树的结构,可以把这个题目看成一个使用std::vector的DFS练习.在输入的时候,把每一层的编号看成以该层的根的编号,该层vector存储以该层为根,孩子的编 ...
PAT甲级1115 DFS和BST
题目 A Binary Search Tree (BST) is recursively defined as a binary tree which has the following proper ...
PAT甲级真题目录（按题型整理）（转自柳神）
转载自:https://www.liuchuo.net/archives/2502?tdsourcetag=s_pcqq_aiomsg 最短路径 1003. Emergency (25)-PAT甲级真 ...
仙人掌相关问题的解法(1)-DFS树解决仙人掌DP问题,圆方树
前言有难度的仙人掌题在近几年也只是在国家集训队水平的比赛里才会出现. 不过,这不是说仙人掌对国集水平以下的选手意义不大: 首先,仙人掌暴力 DP 问题难度并不大,在省选. NOI 甚至 NOIP 中 ...
PAT甲级1155 Heap Paths (30 分)：[C++题解]堆、堆的遍历、树的遍历、dfs输出路径、完全二叉树建树
文章目录题目分析题目链接题目分析来源:acwing 分析: 堆首先是完全二叉树,所以先建完全二叉树,由于给定的是层序遍历的数据,所以直接用数组即可,注意数组下标从1开始,这样便满足结点u和左儿 ...
PAT甲级1021 Deepest Root ：[C++题解]树的最大深度、并查集、dfs求树的深度
文章目录题目分析题目链接题目分析分析: 考察知识点:并查集.dfs.树的深度给定n个结点,n-1条边,只要能保证只有1个连通分量,就是一棵树.否则的话就不是树,它是不连通的. 用并查集来看是 ...

PAT甲级1004 （DFS，树的父子节点）

题目

题解

PAT甲级1004 （DFS，树的父子节点）相关推荐

最新文章

热门文章