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
#include <bits/stdc++.h>
using namespace std;
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int n; cin >> n;
    vector<int>k(n); cin >> k[0];
    vector<vector<int>> v(n, vector<int>());
    v[0].resize(k[0]);
    for (int i = 1; i < n; i++) {
        cin >> k[i];
        v[i].resize(k[i]);
        for (auto &j : v[i]) cin >> j;
    }

    vector<int>pre, cur = vector<int>(k[n - 1], 1);
    int ans = 0;
    for (int i = n - 1; i >= 0; i--) {
        pre = vector<int>(i ? k[i - 1] : 0, 0);
        if (i) {
            for (int j = 0; j < k[i]; j++) {
                int val = v[i][j];
                if (val)
                    pre[val - 1] += cur[j];
            }
            for (auto &j : pre)
                j = max(j, 1);
        }

        ans = max(ans, accumulate(cur.begin(), cur.end(), 0));
        cur = pre;
    }
    cout << ans << "\n";
}