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
#include <iostream>
#include <vector>
#include <numeric>

using namespace std;

void input(int & k, vector<vector<int>> & meetings) {
    cin >> k;
    meetings.resize(k);
    int n1;
    cin >> n1;
    meetings[0] = vector<int>(n1, 0);
    for(int i = 1; i < k; i++) {
        int n;
        cin >> n;
        meetings[i] = vector<int>(n);
        for(int j = 0; j < n; j++) {
            cin >> meetings[i][j];
        }
    }
}

vector<int> get_prev_count(int const prev_size, vector<int> const & cur_deps, vector<int> const & cur_count) {
    vector<int> result(prev_size, 0);
    for(int i = 0; i < cur_deps.size(); i++) {
        if(cur_deps[i] > 0) {
            result[cur_deps[i]-1] += cur_count[i];
        }
    }
    for(int i = 0; i < prev_size; i++) {
        if(result[i] == 0) {
            result[i] = 1;
        }
    }
    return result;
}

int get_result(vector<vector<int>> const & meetings) {
    int result = meetings.back().size();
    vector<int> cur_count = vector<int>(meetings.back().size(), 1);
    for(int i = meetings.size()-1; i >= 1; i--) {
        vector<int> prev_count = get_prev_count(meetings[i-1].size(), meetings[i], cur_count);
        int prev_sum = accumulate(prev_count.begin(), prev_count.end(), 0);
        if(prev_sum > result) {
            result = prev_sum;
        }
        cur_count = move(prev_count);
    }
    return result;
}

void solve() {
    int k;
    vector<vector<int>> meetings;
    input(k, meetings);

    cout << get_result(meetings) << "\n";
}

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

    solve();

    return 0;
}