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
#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

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

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

	vector<vector<int>> data(k);
	vector<vector<int>> require(k);

	data[0] = vector<int>(n + 1);
	require[0] = vector<int>(n + 1);

	int m;

	for (int i = 1; i < k; ++i)
	{
		cin >> m;
		data[i] = vector<int>(m + 1);
		require[i] = vector<int>(m + 1);

		for (int j = 1; j <= m; ++j)
		{
			cin >> data[i][j];
		}
	}

	int curr{};
	int res{};

	for (int i = k - 1; i >= 0; --i)
	{
		curr = 0;

		for (int j = 1; j < require[i].size(); ++j)
		{
			if (require[i][j] == 0)++curr;
			else curr += require[i][j];

			if (i > 0 && data[i][j])
			{
				require[i - 1][data[i][j]] += max(require[i][j], 1);
			}
		}

		res = max(res, curr);
	}

	cout << res;
}