PAT (Advanced Level) 1004. Counting Leaves (30)

简单DFS。

#include<iostream>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<cstdio>
#include<vector>
using namespace std;

const int maxn=+;
vector<int>g[maxn];
int n,m;
int ans[maxn];
int root;
int Deep;

void dfs(int x,int deep)
{
    Deep=max(Deep,deep);
    if(g[x].size()==)
    {
        ans[deep]++;
        return ;
    }
    for(int i=;i<g[x].size();i++)
        dfs(g[x][i],deep+);
}

int main()
{
    scanf("%d%d",&n,&m);
    for(int i=;i<=n;i++) g[i].clear();
    for(int i=;i<=m;i++)
    {
        int id; scanf("%d",&id);
        int k; scanf("%d",&k);
        while(k--)
        {
            int id2; scanf("%d",&id2);
            g[id].push_back(id2);
        }
    }
    memset(ans,,sizeof ans);
    root=; Deep=;
    dfs(root,);
    for(int i=;i<=Deep;i++)
    {
        printf("%d",ans[i]);
        if(i<Deep) printf(" ");
        else printf("\n");
    }
    return ;
}