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
#include <bits/stdc++.h>
#include <unordered_map>

using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<int, int> pii;
typedef vector<vi> vvi;
typedef vector<bool> vb;

#define eb(x) emplace_back(x)
#define loop(i,a,b) for (int (i) = (a); (i) < b; (i)++)
#define rloop(i,a,b) for (int (i) = (a); (i) >= b; (i)--)

int main()
{
    cin.tie(0)->sync_with_stdio(false);

    int k, n1, n,a;

    cin >> k >> n1;

    vvi poprz(k), dp(k);

    poprz[0].resize(n1);
    dp[0].resize(n1);

    loop(i, 1, k)
    {
        cin >> n;
        poprz[i].resize(n);
        dp[i].resize(n);
        loop(j, 0, n)
            cin >> poprz[i][j];
    }

    
    rloop(i, k - 1, 0)
    {
        loop(j, 0, dp[i].size())
        {
            dp[i][j] = max(dp[i][j], 1);

            if (poprz[i][j])
                dp[i - 1][poprz[i][j] - 1] += dp[i][j];
        }
    }
    
    int maxxx = 0;
    loop(i,0,k)
        maxxx = max(maxxx,accumulate(dp[i].begin(), dp[i].end(),0));
    cout << maxxx;
    return 0;
}