B1004 Counting Leaves (BFS)

B1004 Counting Leaves (30分)

//广搜记录每个结点的深度和叶子结点数量。模拟一下就好了

#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <string>
#include <cmath>
#include <math.h>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <stack>
#define lowbit(i)((i)&(-i))
using namespace std;
typedef long long ll;
const int MAX=550;
const int INF=0x3f3f3f3f;
const int MOD=1000000007;
const int SQR=633;
int n,m;
struct node
{
    int level;
    vector<int>child;
}ans[MAX];
int book[MAX];
int maxlevel=0;
void bfs(int start)
{
    memset(book,0,sizeof(book));
    queue<int>q;
    ans[start].level=1;
    q.push(start);
    while(!q.empty())
    {
        int top=q.front();
        q.pop();
        if(ans[top].child.size()==0)
        {
            book[ans[top].level]++;
            maxlevel=max(maxlevel,ans[top].level);
        }
        for(int i=0;i<ans[top].child.size();i++)
        {
            ans[ans[top].child[i]].level=ans[top].level+1;
            q.push(ans[top].child[i]);
        }
    }
}
int main()
{
    scanf("%d%d",&n,&m);
    for(int i=0;i<m;i++)
    {
        int father,k;
        scanf("%d%d",&father,&k);
        for(int i=0;i<k;i++)
        {
            int ch;
            scanf("%d",&ch);
            ans[father].child.push_back(ch);
        }
    }
    bfs(1);
    for(int i=1;i<=maxlevel;i++)
    {
        if(i==1)
            printf("%d",book[i]);
        else
            printf(" %d",book[i]);
    }
    return 0;
}