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

#define REP(x,n) for(int x=0;x<(n);++x)

using namespace std;

const int MAX_N = 500000;
struct Meeting {
    int origin;
    int people;
};

vector<Meeting> meetings[MAX_N];


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

    int k,n;
    cin >> k >> n;
    if (k == 1) {
        cout << n;
        return 0;
    }
    meetings[1].resize(n, Meeting{0,0});
    int ni;
    for (int i = 2; i <= k; i++) {
        auto& dailyMeetings = meetings[i];
        cin >> ni;
        dailyMeetings.resize(ni, Meeting{0,0});
        REP(x,ni) {
            cin >> dailyMeetings[x].origin;
        }
    }

    int bestResult = 0;
    for (int i = k; i >= 0; i--) {
        int currentResult = 0;
        for (Meeting& m : meetings[i]) {
            // cerr << " (" << m.origin << "," << m.people << ")";
            if (m.people == 0) {
                m.people = 1;
            }

            if (m.origin != 0 && i) {
                meetings[i-1][m.origin-1].people += m.people;
            }
            currentResult += m.people;
        }
        bestResult = max(bestResult, currentResult);
        // cerr << endl << "after " << i << " " << currentResult << " / " << bestResult << endl;
    }

    cout << bestResult;
    return 0;
}