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

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

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

    long long ans = 0;

    vector<int> dpPrev(n, 1);
    ans += n;

    for (int day = 2; day <= k; day++) {
        int m;
        cin >> m;

        vector<int> dpCurr(m, 0);

        for (int i = 0; i < m; i++) {
            int a;
            cin >> a;
            if (a > 0) {
                dpCurr[i] += dpPrev[a - 1];
            }
        }

        for (int i = 0; i < m; i++) {
            if (dpCurr[i] == 0) {
                dpCurr[i] = 1;
                ans++;
            }
        }

        dpPrev.swap(dpCurr);
    }

    cout << ans << '\n';
    return 0;
}