1004 Counting Leaves

#include<iostream>
using namespace std;
struct people {
	int father;
	bool ch;
	int level;
}s[110];
int main() {
	int n, m, i, j, k, sp[110] = { 0 };
	cin >> n >> m;
	for (i = 1; i <= n; i++) 
		s[i].ch = false;
	for (i = 1; i <= m; i++) {
		int ID, k,id;
		cin >> ID >> k;
		s[ID].ch = true;
		for (j = 1; j <= k; j++) {
			cin >> id;
			s[id].father = ID;
		}
	}
	s[1].level = 1;
	for (i = 2; i <= n; i++) 
		s[i].level = s[s[i].father].level + 1;
	for (i = 1; i <= n; i++)
		if(!s[i].ch)
		sp[s[i].level]++;
	for (i = 1; i <= s[n].level; i++) {
		cout << sp[i];
		if (i != s[n].level)
			cout << " ";
    }
	return 0;
}