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
#include <bits/stdc++.h>
#define N 500311

using namespace std;

int k;
int n;
vector<int> v[N];
vector<int> w[N];
int x;
int m = 0;
int gm = 0;

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

    cin >> k;
    cin >> n;
    for (int i = 0; i < n; i++) {
        v[0].push_back(0);
    }
    for (int i = 1; i < k; i++) {
        cin >> n;
        for (int j = 0; j < n; j++) {
            v[i].push_back(0);
            cin >> x;
            w[i].push_back(x);
        }
    }
    for (int i = k - 1; i >= 0; i--) {
        m = 0;
        for (int j = 0; j < w[i].size(); j++) {
            if (w[i][j] != 0) {
                v[i - 1][w[i][j] - 1] += max(1, v[i][j]);
            }
        }
        for (int j = 0; j < v[i].size(); j++) {
            m += max(1, v[i][j]);
        }
        gm = max(m, gm);
    }
    cout << gm << "\n";
    return 0;
}