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
#include <iostream>
#include <vector>

int main() {
    int k, n;
    std::cin >> k >> n;
    std::vector<std::vector<long long>> deps(k);
    deps[0] = std::vector<long long>(n);

    for(int i = 1; i < k; i++) {
        std::cin >> n;
        for(int j = 0; j < n; ++j) {
            int x;
            std::cin >> x;
            deps[i].push_back(x);
        }
    }


    std::vector<std::vector<long long>> dp(k);
    for(int i = 0; i < k; i++) {
        dp[i] = std::vector<long long>(deps[i].size());
    }

    long long max = 0;

    for(int i = k - 1; i >= 0; i--) {
        long long sum = 0;
        for (int j = 0; j < deps[i].size(); ++j) {
            dp[i][j] = std::max(1ll, dp[i][j]);
            sum += dp[i][j];
            if (deps[i][j] != 0) {
                dp[i - 1][deps[i][j] - 1] += dp[i][j];
            }
        }
        max = std::max(max, sum);
    }
    std::cout << max << '\n';
}