1004. Counting Leaves
来源:互联网 发布:招商银行网络中心校招 编辑:程序博客网 时间:2024/04/27 02:59
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 Input2 101 1 02Sample Output
0 1
#include <cstdlib>
#include <iostream>
#include <deque>
#include <queue>
#include <cstring>
#include <vector>
#include <string>
#include <iomanip>
#include <map>
#include <set>
#include <cmath>
#include <stack>
#include <cmath>
#include <algorithm>
using namespace std;
#define inf 100000
vector<int>v[100];
int book[1000],maxdepth=-1;
int n,m;
void dfs(int node,int depth)
{
if(v[node].size()==0)
{
book[depth]++;
maxdepth=max(maxdepth,depth);
return ;
}
for(int i=0;i<v[node].size();i++)
dfs(v[node][i],depth+1);
}
int main() {
cin>>n>>m;
for(int i=0;i<m;i++)
{
int id,k;
cin>>id>>k;
for(int j=0;j<k;j++)
{
int child;
cin>>child;
v[id].push_back(child);
}
}
dfs(1,0);
for(int i=0;i<=maxdepth;i++)
{
if(i!=0)printf(" ");
printf("%d",book[i]);
}
return 0;
}
- 1004. Counting Leaves
- 1004. Counting Leaves (30)
- 1004. Counting Leaves
- 1004. Counting Leaves (30)
- 1004. Counting Leaves
- 1004. Counting Leaves (30)
- 1004. Counting Leaves (30)
- 1004. Counting Leaves (30)
- 1004. Counting Leaves (30)
- 1004. Counting Leaves (30)
- 1004.Counting Leaves
- 1004. Counting Leaves (30)
- 1004. Counting Leaves (30)
- 1004. Counting Leaves (30)
- 1004. Counting Leaves (30)
- 1004. Counting Leaves
- 1004. Counting Leaves (30)
- 1004. Counting Leaves (30)
- paint
- 正则表达式匹配
- 1067. Sort with Swap(0,*) (25)
- redis基本结构(5)------有序集合(zset)
- 使用SBT编译Spark子项目
- 1004. Counting Leaves
- 1004
- 为CentOS 6 配置本地YUM源
- 1005. Spell It Right
- 安卓开发中的访问权限问题
- Qt之模式、非模式、半模式对话框
- [Leetcode] #84 Largest Rectangle in Histogram
- Spring Cloud微服务 优雅停止
- 1003