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

using namespace std;

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

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

    vector<vector<int>> rodzice(k + 1);
    vector<vector<long long>> zapotrz(k + 1);

    rodzice[1].push_back(0);
    zapotrz[1].push_back(0);
    for (int j = 1; j <= n1; j++) {
        rodzice[1].push_back(0);
        zapotrz[1].push_back(0);
    }

    for (int i = 2; i <= k; i++) {
        int ni;
        cin >> ni;

        rodzice[i].push_back(0);
        zapotrz[i].push_back(0);

        for (int j = 1; j <= ni; j++) {
            int r;
            cin >> r;
            rodzice[i].push_back(r);
            zapotrz[i].push_back(0);
        }
    }

    long long maks = 0;

    for (int i = k; i >= 1; i--) {
        long long sum = 0;

        for (int j = 1; j < zapotrz[i].size(); j++) {
            if (zapotrz[i][j] == 0) zapotrz[i][j] = 1;

            if (i > 1 && rodzice[i][j] > 0) {
                zapotrz[i - 1][rodzice[i][j]] += zapotrz[i][j];
            }
            sum += zapotrz[i][j];
        }

        if (sum > maks) {
            maks = sum;
        }
    }

    cout << maks;

    return 0;
}