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

int main() {
	cin.tie(0); ios_base::sync_with_stdio(0);
	int n, k;
	cin >> n >> k;

	vector<int> par[n];
	par[0].resize(k);
	for (int i = 1; i < n; i++) {
		int sz; cin >> sz;
		par[i].resize(sz);
		for (int j = 0; j < sz; j++) {
			cin >> par[i][j];
		}
	}
	vector<int> son[n];
	for (int i = 0; i < n; i++) {
		son[i].resize(par[i].size());
	}

	int ans = 0, fre = 0;
	for (int i = n - 1; i >= 0; i--) {
		int lef = 0;
		for (int j = 0; j < son[i].size(); j++) {
			fre += max(son[i][j] - 1, 0);
			if (son[i][j] == 0) {
				lef += 1;
			}
			if (i > 0 && par[i][j] != 0) {
				son[i - 1][par[i][j] - 1] += 1;
			}
		}
		ans += max(0, lef - fre);
		fre = max(0, fre - lef);
	}
	cout << ans << '\n';
}