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
#include <bits/stdc++.h>
#pragma GCC target ("avx2,fma")
#pragma GCC optimize ("Ofast")
#pragma GCC optimize ("unroll-loops")

#define ll long long
#define ld long double
#define endl '\n'
#define st first
#define nd second
#define pb push_back
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
#define FOR(i,l,r) for(int i=(l);i<=(r);i++)
#define ROF(i,r,l) for(int i=(r);i>=(l);i--)
using namespace std;
int inf=1000000007;
ll infl=1000000000000000007;
const ll mod=1000000007;

#ifdef LOCAL
auto&operator<<(auto&o,pair<auto,auto>p){return o<<"("<<p.first<<", "<<p.second<<")";}
auto operator<<(auto&o,auto x)->decltype(x.end(),o){o<<"{";int i=0;for(auto e:x)o<<","+!i++<<e;return o<<"}";}
#define debug(X...)cerr<<"["#X"]: ",[](auto...$){((cerr<<$<<"; "),...)<<endl;}(X)
#else
#define debug(...){}
#endif

const int N=1000007;

int m[N];
bool leaf[N];
int p[N];
vector<int>G[N];
int s[N];

void dfs(int v)
{
	if(leaf[v]) s[v]++;
	for(auto u:G[v])
	{
		dfs(u);
		s[v]+=s[u];
	}
}

signed main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
	int k;
	cin>>k>>m[1];
	int n=m[1];
	FOR(i,1,n) leaf[i]=1;
	FOR(i,2,k)
	{
		cin>>m[i];
		FOR(j,n+1,n+m[i])
		{
			cin>>p[j];
			if(p[j]>0)
			{
				p[j]+=n-m[i-1];
				G[p[j]].pb(j);
				leaf[p[j]]=0;
			}
			leaf[j]=1;
		}
		n+=m[i];
	}
	FOR(i,1,n) if(p[i]==0) dfs(i);
	n=0;
	int ans=0,c=0;
	FOR(i,1,k)
	{
		FOR(j,n+1,n+m[i])
		{
			if(p[j]==0)
			{
				int t=max(0,s[j]-c);
				ans+=t;
				c+=t-s[j];
			}
		}
		FOR(j,n+1,n+m[i]) if(leaf[j]) c++;
		n+=m[i];
	}
	cout<<ans<<endl;
    return 0;
}