1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
#include "bits/stdc++.h" // Tomasz Nowak
using namespace std;     // University of Warsaw
using LL = long long;
#define FOR(i, l, r) for(int i = (l); i <= (r); ++i)
#define REP(i, n) FOR(i, 0, (n) - 1)
#define ssize(x) int(x.size())
template<class A, class B> auto& operator<<(ostream &o, pair<A, B> p) {
	return o << '(' << p.first << ", " << p.second << ')';
}
template<class T> auto operator<<(ostream &o, T x) -> decltype(x.end(), o) {
	o << '{'; int i = 0; for(auto e : x) o << (", ")+2*!i++ << e; return o << '}';
}
#ifdef DEBUG
#define debug(x...) cerr << "[" #x "]: ", [](auto... $) {((cerr << $ << "; "), ...); }(x), cerr << '\n'
#else
#define debug(...) {}
#endif

int main() {
	cin.tie(0)->sync_with_stdio(0);

	int n;
	cin >> n;
	vector<vector<int>> graph(n);
	for(auto &vec : graph) {
		int l;
		cin >> l;
		vec.resize(l);
		for(int &u : vec) {
			cin >> u;
			--u;
		}
	}
	debug(graph);

	vector<vector<int>> revgraph(n);
	REP(v, n)
		for(int u : graph[v])
			revgraph[u].emplace_back(v);
	debug(revgraph);

	vector<LL> answer(n);
	REP(out, n) {
		vector<int> outdeg(n);
		REP(v, n)
			outdeg[v] = ssize(graph[v]);
		vector<int> sztos = {out};
		vector<int> max_id(n);
		iota(max_id.begin(), max_id.end(), 0);
		max_id[out] = out;
		outdeg[out] = 0;

		while(not sztos.empty()) {
			int v = sztos.back();
			if(v != out) {
				debug(v, out, max_id[v]);
				++answer[max_id[v]];
			}
			sztos.pop_back();

			for(int u : revgraph[v]) {
				max_id[u] = max(max_id[u], max_id[v]);
				if(--outdeg[u] == 0)
					sztos.emplace_back(u);
			}
		}
	}
	FOR(i, 1, n - 1)
		answer[i] += answer[i - 1];
	for(LL a : answer)
		cout << a << ' ';
	cout << '\n';
}