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
 92
 93
 94
 95
 96
 97
 98
 99
100
101
#include <cstdio>
#include <cmath>
#include <iostream>
#include <algorithm>
#include <queue>
#include <list>
#include <vector>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <set>
#include <bitset>
#include <stack>
#include <string>
#include <cstring>
#include <cassert>
#include <limits.h>

using namespace std;

typedef long long LL;
typedef long double LD;

typedef vector<int> VI;
#define REP(i,n) for(int i=0;i<(n);i++)
#define FOR(i,a,b) for(VAR(i,a);i<=(b);++i)
#define FORD(i,a,b) for(VAR(i,a);i>=(b);--i)
#define FORE(a,b) for(VAR(a,(b).begin());a!=(b).end();++a)
#define VAR(a,b) __typeof(b) a=(b)
#define SIZE(a) ((int)((a).size()))
#define ALL(x) (x).begin(),(x).end()
#define CLR(x,a) memset(x,a,sizeof(x))
#define ZERO(x) memset(x,0,sizeof(x))
#define S(t,i) scanf("%" ## t, &i)
#define SI(i) scanf("%d", &i)

const int MAXN=500000+11;
int k, n1;
list<int> d[MAXN];
list<int> s[2][MAXN+1];
int scurr=0;
int sprev=1;

list<int> free_empl;
int all_empl = 0;
int get_empl() {
    if (free_empl.empty()) {
        return ++all_empl;
    } else {
        int e=free_empl.front();
        free_empl.pop_front();
        return e;
    }
}

int main() {
    ios_base::sync_with_stdio(0);
    cin >> k >> n1;
    REP(i, n1) {
        d[1].push_back(0);
    }
    FOR(di, 2, k) {
        int ni;
        cin >> ni;
        REP(nii, ni) {
            int ai;
            cin >> ai;
            d[di].push_back(ai);
        }
    }

    FOR(ki, 1, d[k].size()) {
        s[scurr][ki].push_front(get_empl());
    }
    FORD(di, k, 2) {
        sprev = scurr;
        scurr = (scurr+1)%2;

        // FOR(ki, 1, d[di-1].size()) {
        //     assert(s[scurr][ki].empty());
        //     s[scurr][ki].clear();
        // }
        int previ = 0;
        FORE(ki, d[di]) {
            previ++;
            if (*ki > 0) {
                s[scurr][*ki].splice(s[scurr][*ki].begin(), s[sprev][previ]);
            } else {
                free_empl.splice(free_empl.begin(), s[sprev][previ]);
            }
        }
        FOR(ki, 1, d[di-1].size()) {
            if (s[scurr][ki].empty()) {
                s[scurr][ki].push_front(get_empl());
            }
        }
    }

    cout << all_empl << "\n";
    return 0;
}