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

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    long long n, m, maxx = 0;
    cin >> n >> m;
    vector<vector<long long>> v(n), w(n);
    v[0].resize(m);
    w[0].resize(m);
    for (long long i = 1; i < n; i++) {
        long long a;
        cin >> a;
        v[i].resize(a);
        w[i].resize(a);
        for (long long j = 0; j < a; j++) {
            cin >> v[i][j];
            v[i][j]--;
        }
    }
    for (long long j = 0; j < w.back().size(); j++) w.back()[j] = 1;
    for (long long i = n - 1; i >= 1; i--) {
        long long licz = 0;
        for (long long j = 0; j < w[i].size(); j++) {
            if (w[i][j] == 0) w[i][j] = 1;
        }
        for (long long j = 0; j < w[i].size(); j++) {
            if (v[i][j] != -1) w[i - 1][v[i][j]] += w[i][j];
        }
    }
    for (long long j = 0; j < w[0].size(); j++) {
        if (w[0][j] == 0) w[0][j] = 1;
    }
    for (long long i = 0; i < n; i++) {
        long long wyn = 0;
        for (long long j = 0; j < w[i].size(); j++) {
            wyn += w[i][j];
        }
        maxx = max(maxx, wyn);
    }
    cout << maxx;
}