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
// Arti1990, II UWr

#include <bits/stdc++.h>

#define forr(i, n)                  for(int i=0; i<n; i++)
#define FOREACH(iter, coll)         for(auto iter = coll.begin(); iter != coll.end(); ++iter)
#define FOREACHR(iter, coll)        for(auto iter = coll.rbegin(); iter != coll.rend(); ++iter)
#define lbound(P,K,FUN)             ({auto SSS=P, PPP = P-1, KKK=(K)+1; while(PPP+1!=KKK) {SSS = (PPP+(KKK-PPP)/2); if(FUN(SSS)) KKK = SSS; else PPP = SSS;} PPP;})
#define testy()                     int _tests; cin>>_tests; FOR(_test, 1, _tests)
#define CLEAR(tab)                  memset(tab, 0, sizeof(tab))
#define CONTAIN(el, coll)           (coll.find(el) != coll.end())
#define FOR(i, a, b)                for(int i=a; i<=b; i++)
#define FORD(i, a, b)               for(int i=a; i>=b; i--)
#define MP                          make_pair
#define PB                          push_back
#define ff                          first
#define ss                          second
#define deb(X)                      X;
#define SIZE(coll) 					((int)coll.size())

#define M 1000000007
#define INF 1000000007LL

using namespace std;

int n, a, k;

vector <vector<int>> skad, ile;

int solve()
{
    cin >> k >> n;
    skad.PB(vector<int>(n+1, 0));
    ile.PB(vector<int>(n+1, 0));
    forr(i, k-1)
    {
        cin >> n;
        vector <int> v;
        v.PB(0);
        forr(j, n)
        {
            cin >> a;
            v.PB(a);   
        }
        skad.PB(v);
        ile.PB(vector<int>(n+1, 0));
    }

    int wolni = 0;
    FORD(i, k-1, 0)
    {
        FOR(j, 1, skad[i].size()-1)
            if(ile[i][j] == 0)
            {
                ile[i][j]++;
                wolni--;
            }

        wolni = max(wolni, 0);
        /*
        cout << "ile[" << k << "]:";
        FOR(j, 1, skad[i].size()-1)
            cout << " " << ile[i][j];
        cout << '\n';
        cout << "wolni: " << wolni << '\n';
        */
        FOR(j, 1, skad[i].size()-1)
        {
            if(skad[i][j] != 0)
                ile[i-1][skad[i][j]] += ile[i][j];
            else
                wolni += ile[i][j];
        }
    }

    cout << wolni << '\n';

    return 0;
}

int main()
{
    std::ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    solve();

    return 0;
}