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
#include<bits/stdc++.h>
using namespace std;

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

    int k;
    cin>>k;
    
    vector<int> n(k + 1);
    cin >> n[1];

    vector<vector<int>> a(k + 1);
    for (int i = 2; i <= k; ++i) 
    {
        cin >> n[i];
        a[i].resize(n[i] + 1);
        for (int j = 1; j <= n[i]; ++j) 
        {
            cin >> a[i][j];
        }
    }

    long long max_workers = 0;
    vector<long long> req(500000, 0);
    vector<long long> next_req(500000, 0);

    for (int i = k; i >= 1; --i) 
    {
        long long current_day_sum = 0;
        int prev_n = (i > 1) ? n[i - 1] : 0;
        
        for (int j = 1; j <= prev_n; ++j) next_req[j] = 0;


        for (int j = 1; j <= n[i]; ++j) 
        {
            long long r = 1;
            if (i < k) r = max(1LL, req[j]);

            current_day_sum += r;

            if (i > 1 && a[i][j] > 0) next_req[a[i][j]] += r;
        }
        max_workers = max(max_workers, current_day_sum);
        
        for (int j = 1; j <= prev_n; ++j) 
        {
            req[j] = next_req[j];
        }
    }

    cout<<max_workers<<'\n';

    return 0;
}