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
#include <bits/stdc++.h>
using namespace std;
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>> g(n), r(n);
    REP(i, n) {
        int k;
        cin >> k;
        g[i].resize(k);
        for(int &x : g[i]) {
            cin >> x;
            r[--x].emplace_back(i);
        }
    }

    vector<int> ans(n);
    REP(i, n) {
        int ile = -1; 
        vector<int> deg(n);
        REP(j, n) deg[j] = ssize(g[j]);
        debug(i);

        function<void(int, int)> prop = [&](int v, int k) {
            debug(v, k);
            ile++;
            for(int u : r[v])
                if(--deg[u] == 0 && u <= k && u != i)
                    prop(u, k);
        };

        prop(i, -1);

        REP(j, n) { 
            if(deg[j] == 0 && j != i)
                prop(j, j);
            if(j >= i) 
                ans[j] += ile;
        }
    }

    REP(i, n) cout << ans[i] << " ";
    cout << "\n";
}