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
#include <bits/stdc++.h>

using namespace std;

const int Base = 5 * 1e5 + 7;

int k, n;
int tab[2][Base];
vector<int> Tmp;
int Len;
int Pop, Idx = 1;
int Wolni, Nowi;

int Ans;

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cin >> k >> n;
    for(int i = 1; i <= n; i++) {tab[0][i] = 1; Ans++;}
    Len = n;
    int ile, x;
    for(int i = 0; i < k - 1; i++) {

        // cerr << "\n=== " << i << " ===\n";

        cin >> ile;
        Nowi = 0;
        for(int j = 1; j <= ile; j++) {
            cin >> x;
            if(x > 0) {
                if(tab[Pop][x] > 0) {
                    tab[Pop][x]--;
                    tab[Idx][j] = 1;
                } else {
                    Ans++;
                    tab[Idx][j] = 1;
                }
            } else {
                tab[Idx][j] = 1;
                Nowi++;
            }
        }
        for(int j = 1; j <= Len; j++) {
            if(tab[Pop][j]) Wolni++;
        }
        Wolni -= Nowi;
        Ans += max(0, -1 * Wolni);
        Wolni = max(Wolni, 0);

        swap(Idx, Pop);
        Len = ile;

        // cerr << "\nANS: " << Ans << "\n";
    }
    cout << Ans << "\n";
}