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
51
52
53
54
55
56
57
58
59
60
61
#include <bits/stdc++.h>


using namespace std;


int solve(int n, int k, vector <int> &par, vector <int> &day, vector <bool> &leaf) {
    vector <int> load(k + 1, 0);
    for (int i = 0; i < n; i++) if (leaf[i]) {
        load[day[par[i]]]++;
        load[day[i] + 1]--;
    }

    for (int i = 1; i <= k; i++) {
        load[i] += load[i - 1];
    }

    return *max_element(load.begin(), load.end());
}

int main() {
    ios_base::sync_with_stdio(false);

    int k, n;
    cin >> k >> n;

    vector <int> par(n), day(n, 0);
    vector <bool> leaf(n, true);

    iota(par.begin(), par.end(), 0);

    int nPrev = 0;
    for (int d = 1; d < k; d++) {
        int ni;
        cin >> ni;

        day.resize(n + ni, d);
        leaf.resize(n + ni, true);

        for (int i = 0; i < ni; i++) {
            int p;
            cin >> p; p--;

            if (p == -1) {
                par.push_back(n + i);
            } else {
                p += nPrev;

                par.push_back(par[p]);
                leaf[p] = false;
            }
        }

        nPrev = n;
        n += ni;
    }

    cout << solve(n, k, par, day, leaf);

    return 0;
}