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

int k;
int n, o;

vector<int> tab[500'007];
vector<int> licz[500'007];

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    
    cin >> k;
    cin >> n;
    for (int i=0; i<n; i++) tab[0].push_back(0);
    for (int i=0; i<n; i++) licz[0].push_back(0);
    for (int i=1; i<k; i++) {
        cin >> n;
        for (int j=0; j<n; j++) {
            cin >> o;
            tab[i].push_back(o);
            licz[i].push_back(0);
        }
    }
    
    int wolni=0;
    int out=0;
    
    for (int i=k; i>=0; i--) {
        
        for (int j=0; j<tab[i].size(); j++) {
            if (licz[i][j] == 0) {
                if (wolni == 0) {
                    out++;
                    licz[i][j]++;
                } else {
                    licz[i][j]++;
                    wolni--;
                }
            }
        }
        
        for (int j=0; j<tab[i].size(); j++) {
            if (tab[i][j] == 0) {
                wolni += licz[i][j];
            } else {
                
                // zeby nie bylo out of bound
                if (i == 0) continue;
                
                licz[i-1][tab[i][j]-1] += licz[i][j];
            }
        }
        
        // for (int j=0; j<tab[i].size(); j++) cout << licz[i][j] << ' ';
        // cout << endl;
        
        // cout << wolni << endl;
        // cout << out << endl;
    }
    
    cout << out << "\n";
    
    return 0;
}