PAT 1004. Counting Leaves (30)

#include <iostream>
#include <vector>
#include <queue>
using namespace std;


vector<int> ID[105];
int result[105] = {0};


int main(void)
{
int N, M;
scanf("%d %d", &N, &M);


for(int i = 0;i<M;i++)
{
int id, k;
int idj;
scanf("%d %d", &id, &k);
id--;
for (int j = 0;j<k;j++)
{
scanf("%d", &idj);
idj--;
ID[id].push_back(idj);
}
}


//int start = 0;


queue<int> start;
start.push(0);
start.push(-1);


int level = 0;
while (start.size() > 1 )
{
int tmp = start.front();
start.pop();
if (tmp == -1)
{
level++;
start.push(-1);
continue;
}


if (ID[tmp].size() == 0)
{
result[level]++;
}
else
{
for (int i = 0;i<ID[tmp].size();i++)
{
start.push((ID[tmp][i]));
}
/*start.push(-1);*/
}

}


printf("%d", result[0]);
for (int i = 1;i<=level;i++)
{
printf(" %d", result[i]);
}
return 0;
}