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

using namespace std;
#define fors(u, n, s) for(int u = (s); u<(n); u++)
#define foru(u, n) fors(u, n, 0)
#define f first
#define s second
#define vec vector
#define pb push_back
#define sz(x) ((int)x.size())
typedef long long ll;

// #define debug(x) cout << __LINE__ << " | " << x << endl
#define debug(x) {}

void solve() {
	int n; cin >> n;
	vec<vec<vec<int>>> v(n);

	int k0; cin >> k0;
	v[0].resize(k0);

	vec<pair<int, int>> roots;

	foru(i, k0) roots.pb({0, i});

	fors(i, n, 1){
		int k; cin >> k;
		v[i].resize(k);

		foru(j, k){
			int p; cin >> p; p--;
			if(p == -1){
				roots.pb({i, j});
				continue;
			}
			v[i-1][p].pb(j);
		}
	}

	vec<vec<int>> s(n);
	for(int i = n-1; i>=0; i--){
		s[i].resize(v[i].size());
		foru(j, sz(v[i])){
			if(v[i][j].empty()) s[i][j] = 1;
			else s[i][j] = 0;
			for(auto c : v[i][j]) s[i][j] += s[i+1][c];
		}
	}

	vec<int> balance(n+1);

	for(auto p : roots){
		balance[p.f] -= s[p.f][p.s];
		debug("at " << p.f << " debt of " << get_size(p, v));
	}

	foru(i, n) foru(j, sz(v[i])) if(v[i][j].empty()) balance[i+1]++;

	int ans = 0;
	foru(i, n){
		if(balance[i] < 0) ans -= balance[i];
		if(balance[i] > 0) balance[i+1] += balance[i];
	}

	cout << ans << endl;
}

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

	srand(time(NULL));

	solve();

	return 0;
}