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
66
67
68
69
70
71
72
73
74
75
76
77
78
#include <bits/stdc++.h>
#include <cstddef>
using namespace std;

constexpr size_t MAX_K = 500'007;
vector<long long> konf[MAX_K];
vector<long long> ile_musi_byc[MAX_K];

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

    long long k, n1;
    cin >> k >> n1;

    ile_musi_byc[0].resize(n1 + 1, 0);
    
    for (size_t i = 1; i < k; i++)
    {
        size_t n;
        cin >> n;

        konf[i].resize(n + 1);
        ile_musi_byc[i].resize(n + 1, 0);

        for (size_t x = 1; x <= n; x++)
        {
            cin >> konf[i][x];
        }
    }

    size_t ile_w_rezerwie = 9;
    for (size_t i = 0; i < konf[k].size(); i++)
    {
        ile_musi_byc[k][i] = 1;
    }

    for (size_t i = k; i > 0; i--)
    {
        for (size_t x = 1; x < konf[i].size(); x++)
        {
			long long prev = konf[i][x];
            if (prev == 0)
            {
                ile_w_rezerwie += ile_musi_byc[i][x];
                continue;
            }

            ile_musi_byc[i - 1][prev] += ile_musi_byc[i][x];
        }

        for (size_t x = 1; x < konf[i - 1].size(); x++)
        {
            if (konf[i - 1][x] > 0)
            {
                continue;
            }
            
            if (ile_w_rezerwie > 0)
            {
				ile_w_rezerwie--;
			}
			konf[i - 1][x] = 1;
        }
    }

    size_t ans = ile_w_rezerwie;

    for (size_t x = 1; x < konf[0].size(); x++)
    {
        ans += ile_musi_byc[0][x];
    }

    cout << ans << "\n";

    return 0;
}