PAT 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

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等到每个节点的高度，第二次bfs得到根据每个节点所在高度得到每层（对应于高度）的叶子节点数。具体见代码：

#include <iostream>
#include <list>
#include <vector>
#include <stack>
#include <algorithm>
using namespace std;

const int N=;

vector<list<int> > Tree(N);
int nodeHeight[N]={-};   //height from 0
int heightLeaves[N];

void bfs_getHeight()
{
    stack<int> s;
    s.push();
    nodeHeight[]=;
    int curNode,childNode;
    while(!s.empty())
    {
        curNode=s.top();
        s.pop();
        for(list<int>::iterator iter=Tree[curNode].begin();iter!=Tree[curNode].end();++iter)
        {
            childNode=*iter;
            nodeHeight[childNode]=nodeHeight[curNode]+;
            if(Tree[childNode].size()!=)
                s.push(childNode);
        }
    }
}

void bfs_getLeaves()
{
    stack<int> s;
    s.push();
    int curNode,childNode;
    size_t size;
    while(!s.empty())
    {
        curNode=s.top();
        s.pop();
        for(list<int>::iterator iter=Tree[curNode].begin();iter!=Tree[curNode].end();++iter)
        {
            childNode=*iter;
            if(==Tree[childNode].size())
                ++heightLeaves[nodeHeight[childNode]];
            else
                s.push(childNode);
        }
    }
}

int _tmain(int argc, _TCHAR* argv[])
{
    int n,m;
    cin>>n>>m;
    int ID,k,IDbuf;
    for(int i=;i<m;++i)
    {
        cin>>ID>>k;
        for(int j=;j<k;++j)
        {
            cin>>IDbuf;
            Tree[ID].push_back(IDbuf);
        }
    }
    bfs_getHeight();
    bfs_getLeaves();
    int maxHeight=*max_element(nodeHeight,nodeHeight+N);
    for(int i=;i<maxHeight;++i)
    {
        cout<<heightLeaves[i]<<' ';
    }
    cout<<heightLeaves[maxHeight];
    return ;
}

但是结果有一个3分的测试点过不了，也不知道错在哪里，实在是没招了，就用了深搜，而且正好可以在每次递归的时候传递层数，反而只需要一次dfs就可以搞定了，相对于第一种解法，第二种解法根据N-M的值为叶子节点数，在输出的时候做了优化。具体见代码：

#include <stdio.h>
#include <map>
#include <vector>
using namespace std;

const int N=;
map<int,vector<int> > adjlist;
int levelLeaves[N]={};

void dfs(int node,int level)
{
    if(adjlist[node].empty())
    {
        ++levelLeaves[level];
        return;
    }
    vector<int>::iterator iter=adjlist[node].begin();
    for(;iter!=adjlist[node].end();++iter)
        dfs(*iter,level+);
}

int _tmain(int argc, _TCHAR* argv[])
{
    freopen("1004.txt","r",stdin);
    int N,M,ID,K,childID,leaves,cnt;
    scanf("%d%d",&N,&M);
    leaves=N-M;
    while(M--)
    {
        scanf("%d%d",&ID,&K);
        while(K--)
        {
            scanf("%d",&childID);
            adjlist[ID].push_back(childID);
        }
    }
    dfs(,);
    printf("%d",levelLeaves[]);
    cnt=levelLeaves[];
    for(int i=;cnt<leaves;++i)
    {
        printf(" %d",levelLeaves[i]);
        cnt+=levelLeaves[i];
    }
    printf("\n");
    return ;
}