A1004-1.cpp

/*
 *	author:		zhouyuhao
 *	created:	2023-03-29 13:12:14
 *	modified:	2023-03-29 15:00:45
 *	item:		Programming Ability Test
 *	site:		Yuting
 */
#include <algorithm>
#include <iostream>
#include <map>
#include <vector>

using namespace std;

int h = -1;
map<int, int> cnt;
vector<vector<int>> t;

void dfs(int r, int l) {
	h = max(h, l);
	if (t[r].empty()) {
		++cnt[l];
		return;
	}
	for (int i = 0; i < (int)t[r].size(); i++) {
		dfs(t[r][i], l + 1);
	}
}

int main(int argc, char const *argv[]) {

	int n, m;
	cin >> n >> m;
	t.resize(n + 1);
	vector<bool> isroot(n + 1, true);
	for (int i = 0; i < m; i++) {
		int id, k;
		cin >> id >> k;
		for (int j = 0; j < k; j++) {
			int c;
			cin >> c;
			t[id].emplace_back(c);
			isroot[c] = false;
		}
	}
	int r = find(isroot.begin(), isroot.end(), true) - isroot.begin() + 1;
	dfs(r, 1);
	for (int i = 1; i <= h; i++) {
		cout << cnt[i];
		i <= h - 1 ? cout << " " : cout << "\n";
	}

	return 0;
}