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
#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for (int i=a;i<n;i++)
#define per(i,a,n) for (int i=n-1;i>=a;i--)
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
typedef vector<int> VI;
typedef long long ll;
typedef pair<int,int> PII;
typedef double db;
//mt19937 mrand(random_device{}());
const ll mod=1000000007;
//int rnd(int x) { return mrand() % x;}
ll powmod(ll a,ll b) {ll res=1;a%=mod; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}
int gcd(int a,int b) { return b?gcd(b,a%b):a;}
// head

const int N=5e5+5;

#define INF 0x3f3f3f3f

template<class T> inline void read(T &x) {
    x=0; int c=getchar(),f=1;
    for (;!isdigit(c);c=getchar()) if (c==45) f=-1;
    for (;isdigit(c);c=getchar()) (x*=10)+=f*(c-'0');
}

ll roots_req[N],leaves[N];

int main() {
	int k,n_1;
	scanf("%d%d",&k,&n_1);
	vector<VI>par(k+1);
	vector<vector<ll>>need(k+1);
	par[1].assign(n_1+1,0);
	need[1].assign(n_1+1,0);
	rep(i,2,k+1) {
		int n_i;
		scanf("%d",&n_i);
		par[i].assign(n_i+1,0);
		need[i].assign(n_i+1,0);
		rep(j,1,n_i+1) scanf("%d",&par[i][j]);
	}
	per(i,1,k+1) {
		int n_i=SZ(par[i])-1;
		rep(j,1,n_i+1) {
			if (need[i][j]==0) {
				need[i][j]=1;
				leaves[i]++;
			}
			if (i==1||par[i][j]==0) roots_req[i]+=need[i][j];
		}
		if (i>1) rep(j,1,n_i+1) if (par[i][j]>0) need[i-1][par[i][j]]+=need[i][j];
	}
	ll ans=0,pool=0;
	rep(i,1,k+1) {
		ans+=max(0LL,roots_req[i]-pool);
		pool=max(0LL,pool-roots_req[i])+leaves[i];
	}
	printf("%lld\n",ans);
}