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
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
#include <algorithm>
#include <bitset>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>

using namespace std;

#define PB push_back
#define MP make_pair
#define F first
#define S second
#define ALL(x) (x).begin(),(x).end()
#define SIZE(x) (int)(x).size()
#define CLEAR(tab) memset(tab, 0, sizeof(tab))
#define REP(x, n) for(int x = 0; x < (n); x++)
#define FOR(x, b, e) for(int x = (b); x <= (e); x++)
#define FORD(x, b, e) for(int x = (b); x >= (e); x--)
#define VAR(v, n) __typeof(n) v = (n)
#define FOREACH(i, c) for(VAR(i, (c).begin()); i != (c).end(); ++i)
#define DEBUG(fmt, ...) fprintf(stderr, fmt, ##__VA_ARGS__)

typedef long long int LL;
typedef pair<int,int> PII;
typedef vector<int> VI;

const int MXN = 500010;
const int C = 262144;
const int INF = 1000000001;
const int MOD = 1000000007;

int n, k;
VI parent[MXN];
VI leaf_count[MXN];
VI is_leaf[MXN];

int res[MXN];
int ni[MXN];

int main() {
	scanf("%d %d", &k, &ni[1]);
	leaf_count[1].resize(ni[1], 1);
	is_leaf[1].resize(ni[1], 1);
	FOR(i, 2, k) {
		scanf("%d", &ni[i]);
		is_leaf[i].resize(ni[i], 1);
		FOR(j, 1, ni[i]) {
			int a_ij;
			scanf("%d", &a_ij);
			parent[i].PB(a_ij - 1);
			if(a_ij)
				is_leaf[i - 1][a_ij - 1] = 0;
		}
		leaf_count[i].resize(ni[i], 0);
	}

	FOR(j, 1, k)
		FOR(i, 0, ni[j] - 1)
			leaf_count[j][i] = is_leaf[j][i];

	FORD(i, k, 2) {
		FOR(j, 0, ni[i] - 1){
			if(parent[i][j] >= 0) {
				leaf_count[i - 1][parent[i][j]] += leaf_count[i][j];
			}
		}
	}

	FOR(i, 0, ni[1] - 1)
		res[1] += leaf_count[1][i];
	int R = res[1];

	FOR(i, 2, k) {
		int need = 0;
		int covered = 0;
		FOR(j, 0, ni[i] - 1) {
			if(parent[i][j] == -1)
				need += leaf_count[i][j];
			else
				covered += leaf_count[i][j];
		}
		int diff = res[i - 1] - covered;
		res[i] = covered + max(need, diff);
		R = max(R, res[i]);
		res[i] = max(res[i], res[i - 1]);
	}

	printf("%d\n", R);
	return 0;
}