zoukankan      html  css  js  c++  java
  • PAT 1004 Counting Leaves

    1004. Counting Leaves (30)

    时间限制
    400 ms
    内存限制
    65536 kB
    代码长度限制
    16000 B
    判题程序
    Standard
    作者
    CHEN, Yue
    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
    题意要求求出每一层的叶子节点的个数,用BFS即可
    #include <iostream>
    #include <string.h>
    #include <stdlib.h>
    #include <stdio.h>
    #include <algorithm>
    #include <math.h>
    #include <queue>
    
    using namespace std;
    #define MAX 100
    int n,m,k;
    struct Node
    {
      int value;
      int next;
    }edge[MAX*4];
    int head[MAX+5];
    int tot;
    void add(int x,int y)
    {
      edge[tot].value=y;
      edge[tot].next=head[x];
      head[x]=tot++;
    }
    int ans[1005];
    int bfs()
    {
        queue<pair<int,int> > q;
      q.push(make_pair(1,1));
      memset(ans,0,sizeof(ans));
      pair<int,int> term;
      int num=0;
      while(!q.empty())
      {
          term=q.front();
        q.pop();
        num=max(num,term.second);
        int tag=0;
        for(int i=head[term.first];i!=-1;i=edge[i].next)
        {
          int y=edge[i].value;
          q.push(make_pair(y,term.second+1));
          tag=1;
        }
        if(!tag)
          ans[term.second]++;
      }
      return num;
    }
    int main()
    {
      int x,y;
      scanf("%d%d",&n,&m);
      memset(head,-1,sizeof(head));
      tot=0;
      for(int i=1;i<=m;i++)
      {
           scanf("%d%d",&x,&k);
         for(int j=1;j<=k;j++)
         {
              scanf("%d",&y);
          add(x,y);
         }
      }
      int num=bfs();
      for(int i=1;i<=num;i++)
      {
        if(i==num)
          printf("%d
    ",ans[i]);
        else
        printf("%d ",ans[i]);
      }
      return 0;
    }


  • 相关阅读:
    nginx文件类型错误解析漏洞
    js 获取URL中的参数并转换为对象
    postman
    php curl参数详解
    php 两变量值互换 方法
    PHP 命名空间与spl_autoload_register() 自动加载机制
    php命名大小问题
    PHP实现冒泡排序
    使用 PHPStorm + Xdebug 实现断点调试(二)
    TSPL学习笔记(2):过程和变量绑定
  • 原文地址:https://www.cnblogs.com/dacc123/p/8228625.html
Copyright © 2011-2022 走看看