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
// Tadeusz Bindas
#include <iostream>

int main() {
    int k, n, ni_bef, ni, tmp, zeros, sum;
    int* l;
    std::cin >> k >> n;
    ni_bef = n;
    for (int i = 1; i < k; i++) {
        std::cin >> ni;

        l = new int[ni_bef] {};
        zeros = 0;
        sum = 0;

        for (int j = 0; j < ni; j++) {
            std::cin >> tmp;
            if (tmp == 0)
                zeros++;
            else {
                l[tmp-1]++;
                sum++;
            }
        }

        for (int j = 0; j < ni_bef; j++)
            if (l[j] > 1)
                n += l[j] - 1;

        if (n - sum < zeros)
            n = zeros;
        delete[] l;
        ni_bef = ni;
    }

    std::cout << n << std::endl;
    return 0;
}