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

using namespace std;

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

    int k, n1;
    if (!(cin >> k >> n1)) return 0;

    vector<int> day_start(k);
    day_start[0] = 0;
    
    vector<int> parent;
    parent.reserve(500000); 

    for (int i = 0; i < n1; ++i) {
        parent.push_back(0);
    }

    for (int i = 1; i < k; ++i) {
        int ni;
        cin >> ni;
        day_start[i] = parent.size();
        for (int j = 0; j < ni; ++j) {
            int p;
            cin >> p;
            parent.push_back(p);
        }
    }

    int total_meetings = parent.size();
    
    vector<int> req(total_meetings, 0);
    long long max_employees = 0;

    for (int i = k - 1; i >= 0; --i) {
        long long current_day_employees = 0;
        int start_idx = day_start[i];
        int end_idx = (i == k - 1) ? total_meetings : day_start[i + 1];

        for (int j = start_idx; j < end_idx; ++j) {
            req[j] = max(1, req[j]);
            current_day_employees += req[j];

            int p = parent[j];
            if (p > 0) {
                int parent_idx = day_start[i - 1] + p - 1;
                req[parent_idx] += req[j];
            }
        }
        
        if (current_day_employees > max_employees) {
            max_employees = current_day_employees;
        }
    }

    cout << max_employees << "\n";

    return 0;
}