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
#ifndef UNCLE
 #pragma GCC optimize("O3,unroll-loops")
#endif

#include <bits/stdc++.h>
using namespace std;

#define FOR(i,p,q) for(int i=(p); i<=(q); ++i)
#define ROF(i,p,q) for(int i=(p); i>=(q); --i)
#define REP(i,q) for(int i=0; i<(q); ++i)
#define pb push_back
#define as assign
#define rz resize
#define Co const
#define al(X) X.begin(), X.end()
#define ral(X) X.rbegin(), X.rend()
#define sz(X) (int)((X).size())
#define ckmx(a,b) a=max(a,b)
#define ckmn(a,b) a=min(a,b)
#define V vector
typedef long long ll;
typedef long double ld;
typedef mt19937_64 mt;
#ifndef UNCLE
 typedef basic_string<bool> vb;
 typedef basic_string<int> vi;
 typedef basic_string<ll> vl;
#else
 typedef V<bool> vb;
 typedef V<int> vi;
 typedef V<ll> vl;
#endif

constexpr ll INFl=(ll)1e18+14;
constexpr int INFi=1e9+14, MX_N=5e5+14;

int N,M,Q;
void Inpt(){
    cin>>M;
    vi n(M,-1);
    V<vi> qtf(M,vi()),sn(M,vi()),qt(M,vi());
    cin>>n[0];
    qtf[0].as(n[0],0),sn[0].as(n[0],-1),qt[0].as(n[0],0);
    FOR(i,1,M-1){
        cin>>n[i];
        qtf[i].as(n[i],0),sn[i].as(n[i],-1),qt[i].as(n[i],0);
        for(int &vv:sn[i]){
            cin>>vv,--vv;
            if(vv!=-1) ++qtf[i-1][vv];
        }
    }
    ROF(i,M-1,0){
        REP(j,n[i]){
            if(qtf[i][j]==0) ++qt[i][j];
            if(i&&sn[i][j]!=-1) qt[i-1][sn[i][j]]+=qt[i][j];
        }
    }
    int rs=0,cqt=0;
    REP(i,M){
        REP(j,n[i]) if(sn[i][j]==-1) cqt-=qt[i][j];
        if(cqt<0) rs+=-cqt, cqt=0;
        REP(j,n[i]) if(qtf[i][j]==0) ++cqt;
    }
    cout<<rs<<"\n";
}
signed main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0), cout.tie(0);

    Inpt();
}