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

using namespace std;

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

    int k, n1;
    cin >> k >> n1;

    vector<int> n(k + 1);
    n[1] = n1;
    
    vector<vector<int>> a(k + 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<long long>> W(k + 1);
    for (int i = 1; i <= k; ++i) {
        W[i].assign(n[i] + 1, 0);
    }

    long long max_w = 0;
    
    for (int i = k; i >= 1; --i) {
        long long curent_day_sum = 0;
        
        for (int j = 1; j <= n[i]; ++j) {
            W[i][j] = max(1LL, W[i][j]); 
            curent_day_sum += W[i][j];
            if (i > 1 && a[i][j] > 0) {
                W[i - 1][a[i][j]] += W[i][j];
            }
        }
        max_w = max(max_w, curent_day_sum);
    }
    
    cout << max_w;

    return 0;
}