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

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int k;
    cin >> k;
    vector<vector<pair<int, int>>> meetings(k);
    int n;
    for (int i = 0; i < k; i++)
    {
        cin >> n;
        meetings[i].resize(n);
        for (int j = 0; j < n; j++)
        {
            meetings[i][j].first = 0;
            meetings[i][j].second = 0;
            if (i > 0)
                cin >> meetings[i][j].second;
            meetings[i][j].second--;
        }
    }

    int wyn = 0;
    for (int i = k - 1; i >= 0; i--)
    {
        int sum = 0;
        for (int j = 0; j < meetings[i].size(); j++)
        {
            meetings[i][j].first = max(meetings[i][j].first, 1);
            sum += meetings[i][j].first;
            if (meetings[i][j].second >= 0)
            {
                meetings[i - 1][meetings[i][j].second].first += meetings[i][j].first;
            }
        }
        wyn = max(wyn, sum);
    }
    // for (int i = 0; i < k; i++)
    // {
    //     for (int j = 0; j < meetings[i].size(); j++)
    //     {

    //         cout << meetings[i][j].first << " " << meetings[i][j].second << "\n";
    //     }
    //     cout << "====================\n";
    // }
    cout << wyn << "\n";
}