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
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
#include <bits/stdc++.h>

using namespace std;

#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
#define YES cout << "YES\n"
#define NO cout << "NO\n"
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef long double ld;

#ifdef LOCAL
#define DTP(x, y)                                    \
    auto operator<<(auto &o, auto a)->decltype(y, o) \
    {                                                \
        o << "(";                                    \
        x;                                           \
        return o << ")";                             \
    }
DTP(o << a.first << ", " << a.second, a.second);
DTP(for (auto i : a) o << i << ", ", all(a));
void dump(auto... x) { ((cerr << x << ", "), ...) << '\n'; }
#define debug(x...) cerr << setw(4) << __LINE__ << ":[" #x "]: ", dump(x)
#else
#define debug(...) 42
#endif

stringstream os;
void testing()
{
    /*
        Here create tests by pushing to os (<<).
    */
    os = stringstream();
    os.seekg(0, ios::beg);
    cin.rdbuf(os.rdbuf());
}

void solve()
{
    int k, n;
    cin >> k >> n;
    vector<vi> V(k);
    vector<vi> G(k);
    vi D(k);
    V[0].resize(n, 0);
    for (int i = 1; i < k; i++)
    {
        cin >> n;
        V[i].resize(n, 0);
        G[i].resize(n);
        for (auto &a : G[i])
        {
            cin >> a;
            --a;
        }
    }
    for (int i = k - 1; i > 0; i--)
    {
        for (auto &a : V[i])
            if (a == 0)
                a = 1;
        for (int j = 0; j < sz(G[i]); j++)
            if (G[i][j] >= 0)
                V[i - 1][G[i][j]] += V[i][j];
    }
    for (auto &a : V[0])
        if (a == 0)
            a = 1;
    // for (auto &a : V)
    //     debug(a);
    int ans = 0;
    for (int i = 0; i < k; i++)
    {
        int sum = 0;
        for (auto &a : V[i])
            sum += a;
        ans = max(ans, sum);
    }
    cout << ans << endl;
}

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

    int Z = 1;
    // cin >> Z;
    while (Z--)
        solve();
}