PAT练习题 1004 Counting Leaves (30分)

传送门：1004

---

1004 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 Specification:
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.

The input ends with N being 0. That case must NOT be processed.

Output Specification:
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

---

水题

AC代码：

#include<iostream>
#include<algorithm>
#include<cstring>
#include<cstdio>
#include<cmath>
#include<vector>
#define ll long long
#define inf 0x3f3f3f3f
using namespace std;
const int N=110;
int n,m;
int id,k,level;
int tree[10][N],father[N];
vector<int> g[N];
int sum[N];
void dfs(int x,int lev)//判断每一层有几个点没有子树
{
  level=max(level,lev);
  int len=g[x].size();
  for(int i=0;i<len;i++)
  {
    int u=g[x][i];
    int l=g[u].size();
    if(l==0)
    {
      sum[lev]++;
    }
    else
    {
      dfs(u,lev+1);
    }
  }
}
int main()
{
  memset(sum,0,sizeof(sum));
  memset(father,-1,sizeof(father));
  scanf("%d%d",&n,&m);

  while(m--)
  {
    scanf("%d %d",&id,&k);
    int x;
    for(int i=0;i<k;i++)
    {
      scanf("%d",&x);
      father[x]=id;
      g[id].push_back(x);
    }
  }
  if(n==0)
  {
    return 0;
  }
  if(n==1)//只有一个点的时候，及树只有一层，那么答案应只输出1
  {
    printf("1\n");
    return 0;
  }
  int root=1;
  while(father[root]!=-1)//找根节点
  {
    root=father[root];
  }
  level=0;
  dfs(root,2);
  //printf("%d\n",level);
  for(int i=1;i<=level;i++)
  {
    printf("%d%c",sum[i],i==level?'\n':' ');
  }
  return 0;
}