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
58
59
60
#include <bits/stdc++.h>
using namespace std;
vector <vector <int> > g;
vector <bool> vis;
vector <int> req;

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	int k;
	cin >> k;
	vector <vector <int> > ids(k);
	int n1;
	cin >> n1;
	int curid = 0;
	for (int i = 0; i < n1; i++) {
		ids[0].emplace_back(curid++);
	}
	vector <vector <int> > s(k);
	for (int i = 1; i < k; i ++) {
		int n;
		cin >> n;
		for (int j = 0; j < n; j++) {
			ids[i].emplace_back(curid++);
			int a;
			cin >> a;
			s[i].emplace_back(a);
		}
	}

	int n = curid;
	g.resize(n);
	vis.resize(n);
	req.resize(n);
	for (int i = 0; i < k; i++) {
		for (int j = 0; j < (int)s[i].size(); j++) {
			if (s[i][j] != 0) {
				g[ids[i-1][s[i][j]-1]].emplace_back(ids[i][j]);
			}
		}
	}
	for (int i = n-1; i >= 0; i--) {
		if (g[i].empty())
			req[i] = 1;
		else {
			for (auto j : g[i])	
				req[i] += req[j];
		}
	}
	int res = 0;
	for (int i = 0; i < k; i++) {
		int temp = 0;
		for (int j = 0; j < (int)ids[i].size(); j++) {
			temp += req[ids[i][j]];
		}
		res = max(res, temp);
	}
	cout << res << "\n";

}