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

signed main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    int k;
    cin >> k;

    vector<vector<int>> a(k + 1);
    vector<int> n(k + 1);

    cin >> n[1];
    
    for (int i = 2; i <= k; i++) {
        cin >> n[i];
        a[i].resize(n[i] + 1);
        for (int j = 1; j <= n[i]; j++)
            cin >> a[i][j];
    }

    vector<vector<int>> dp(k + 1);
    for (int i = 1; i <= k; i++) 
        dp[i].assign(n[i] + 1, 0);

    for (int i = k; i >= 1; i--) {
        for (int j = 1; j <= n[i]; j++) {
            if (dp[i][j] == 0)
                dp[i][j] = 1;

            if (i > 1 && a[i][j] > 0) 
                dp[i-1][a[i][j]] += dp[i][j];
        }
    }

    int res = 0;
    for (int j = 1; j <= n[1]; j++) 
        res += dp[1][j];

    int odp = 0;
    for (int i = 1; i <= k; i++) {
        res = 0;
        for (int j = 1; j <= n[i]; j++) 
            res += dp[i][j];
        odp = max(odp, res);
    }
    cout << odp;
}