#include <cstdio>
#include <vector>
#include<queue>
#include<algorithm>
using namespace std;
struct node
{
int layer;
vector<int>child;
}Node[110];
int n,m,level = 1;
int pop[100] = {0};
void Dfs(int root,int lay)
{
Node[root].layer = lay;
if(level < Node[root].layer)
level = Node[root].layer;
if(Node[root].child.size() == 0)
{
pop[Node[root].layer]++;
}
for(int i = 0;i<Node[root].child.size();i++)
{
Dfs(Node[root].child[i],lay+1);
}
}
int main()
{
// freopen("in.txt","r",stdin);
scanf("%d%d",&n,&m);
if(n!=0)
{
Node[1].layer = 1;
fill(pop,pop+100,0);
for(int i = 1;i<=m;i++)
{
int fid,k;
scanf("%d %d",&fid,&k);
for(int j = 0;j<k;j++)
{
int t;
scanf("%d",&t);
Node[fid].child.push_back(t);
}
}
Dfs(1,1);
int maxn = 1,large = 1;
for(int i = 1;i<=level;i++)
{
printf("%d",pop[i]);
if(i!=level)
printf(" ");
else
printf("\n");
}
}
}
1004 Counting Leaves (30 分)(DFS)
猜你喜欢
转载自blog.csdn.net/qq_15556537/article/details/100392111
今日推荐
周排行