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

int main() {
    int k; cin >> k;
    vector<int> n(k);
    cin >> n[0];
    vector<vector<vector<int>>> succ(k);
    succ[0].resize(n[0]);
    for (int i = 1; i < k; i++) {
        cin >> n[i];
        succ[i].resize(n[i]);
        for (int j = 0; j < n[i]; j++) {
            int x; cin >> x;
            if (x > 0) succ[i-1][x-1].push_back(j);
        }
    }

    int res = 0;
    vector<vector<int>> dp(k);
    for (int i = k-1; i >= 0; i--) {
        dp[i].resize(n[i]);
        for (int j = 0; j < n[i]; j++) {
            for (int nj: succ[i][j]) dp[i][j] += dp[i+1][nj];
            if (succ[i][j].empty()) dp[i][j] = 1;
        }
        res = max(res, accumulate(begin(dp[i]), end(dp[i]), 0));
    }
    cout << res << '\n';
}