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

using namespace std;

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

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

    vector<vector<int>> edges(k);
    vector<vector<int>> values(k);

    values[0].resize(n);

    for (int i = 1; i < k; ++i)
    {
        cin >> n;

        edges[i].resize(n);
        values[i].resize(n);

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

    int res = 0;

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

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

            if (i > 0 && edges[i][j] >= 0)
                values[i - 1][edges[i][j]] += values[i][j];

            cnt += values[i][j];
        }

        res = max(res, cnt);
    }

    cout << res << "\n";

    return 0;
}