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
#include <bits/stdc++.h>
using namespace std;
using ll = long long;

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    int k, n;
    cin >> k >> n;

    vector<vector<vector<int>>> g(k);
    g[0].resize(n);
    
    for (int i = 1; i < k; i++)
    {
        int n_i;
        cin >> n_i;
        g[i].resize(n_i);

        for (int j = 0; j < n_i; j++)
        {
            int p;
            cin >> p;

            if (p != 0)
                g[i-1][p-1].push_back(j);
        }
    }

    vector<vector<ll>> dp(k);
    for (int i = 0; i < k; i++)
        dp[i].resize(g[i].size(), -1LL);

    function<void(int, int)> dfs = [&](int i, int j)
    {
        if (g[i][j].empty())
        {
            dp[i][j] = 1LL;
            return;
        }

        dp[i][j] = 0LL;
        for (int j_ : g[i][j])
        {
            int i_ = i+1;
            dfs(i_, j_);
            dp[i][j] += dp[i_][j_];
        }
    };

    vector<ll> row(k);
    for (int i = 0; i < k; i++)
        for (int j = 0; j < g[i].size(); j++)
        {
            if (dp[i][j] == -1LL)
                dfs(i, j);
            row[i] += dp[i][j];
        }

    ll ans = *max_element(row.begin(), row.end());
    cout << ans << '\n';
}