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 <algorithm>
#include <vector>
#include <iostream>
using namespace std;

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

    int k, n; cin >> k >> n;
    vector<vector<int>> a(k), val(k);
    a[0] = vector<int>(n, -1);
    val[0] = vector<int>(n, 0);

    for (int i = 1; i < k; i++) {
        cin >> n;
        a[i] = val[i] = vector<int>(n);
        for (int j = 0; j < n; j++) { 
            cin >> a[i][j];
            a[i][j] -= 1;
        }
    }

    for (int i = k - 1; i >= 0; i--) {
        for (int j = 0; j < (int)a[i].size(); j++) {
            if (val[i][j] == 0) val[i][j] = 1;
            if (a[i][j] != -1) val[i - 1][a[i][j]] += val[i][j]; 
        }
    }

    int res = 0;
    for (int i = 0; i < k; i++) {
        int layer = 0;
        for (int j = 0; j < (int)a[i].size(); j++) layer += val[i][j];
        res = max(res, layer);
    }
    cout << res << '\n';
    return 0;
}
/*

4 3
3 1 1 1
4 0 0 2 0
2 3 3

toster --io runda-1/kon_tests/small  runda-1/B.e
toster --io runda-1/kon_tests/medium runda-1/B.e
toster --io runda-1/kon_tests/large  runda-1/B.e

*/