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
//Author: Kevin
#include<bits/stdc++.h>
//#pragma GCC optimize("O2")
using namespace std;
#define pb emplace_back
#define mp make_pair
#define ALL(x) (x).begin(),(x).end()
#define rALL(x) (x).rbegin(),(x).rend()
#define srt(x) sort(ALL(x))
#define rev(x) reverse(ALL(x))
#define rsrt(x) sort(rALL(x))
#define sz(x) (int)(x.size())
#define inf 0x3f3f3f3f
#define lb(v,x) (int)(lower_bound(ALL(v),x)-v.begin())
#define ub(v,x) (int)(upper_bound(ALL(v),x)-v.begin())
#define uni(v) v.resize(unique(ALL(v))-v.begin())
using ll=long long;
using ull=unsigned long long;
using pii=pair<int,int>;
using i128=__int128_t;
void die(string S){puts(S.c_str());exit(0);}
int n;
vector<vector<int>> id,cc;
int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	cin>>n;
	id=cc=vector<vector<int>>(n);
	for(int i=0;i<n;i++)
	{
		int k;
		cin>>k;
		id[i]=cc[i]=vector<int>(k);
		if(i)
			for(auto &j:cc[i]) cin>>j;
		for(auto &j:cc[i]) j--;
	}
	int have=0;
	int ans=0;
	for(int i=n-1;i>=0;i--)
	{
		int nhave=0;
		for(int j=0;j<sz(id[i]);j++)
		{
			if(!id[i][j])
			{
				id[i][j]=1;
				if(have) have--;
				else ans++;
			}
			if(~cc[i][j])
			{
				id[i-1][cc[i][j]]+=id[i][j];
				id[i][j]=0;
			}
			nhave+=id[i][j];
		}
		have+=nhave;
	}
	cout<<ans<<'\n';
	return 0;
}