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
#include <bits/stdc++.h>
using namespace std;
int main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	
	int k;
	cin >> k;
	vector<vector<int>> in(k+1);
	vector<int> n(k+1);
	cin >> n[1];
	for (int i = 2; i <= k; i++) {
		cin >> n[i];
		in[i].resize(n[i]+1);
		for (int j = 1; j <= n[i]; j++) {
			cin >> in[i][j];
		}
	}
	vector<vector<int>> dp(k+1);
	for (int i = 1; i <= k; i++) {
		dp[i].resize(n[i] + 1, 0);
	}
	for (int i = k; i >= 2; --i) {
		for (int j = 1; j <= n[i]; j++) {
			dp[i][j] = max(1, dp[i][j]);
			if (in[i][j]) {
				dp[i-1][in[i][j]] += dp[i][j];
			}
		}
	}
	int answer = 0;
	for (int i = 1; i <= k; i++) {
		int sum = 0;
		for (int j = 1; j <= n[i]; j++) {
			sum += max(1, dp[i][j]);
		}
		answer = max(answer, sum);
	}
	cout << answer << "\n";
}