#include <bits/stdc++.h>
#include <cstdlib>
using namespace std;
int main()
{
std::ios_base::sync_with_stdio(false);
std::cin.tie(NULL);
int k, n1;
cin >> k >> n1;
int odp = n1;
vector<vector<int>> input;
input.reserve(k);
input.push_back(vector<int>(n1, 0));
vector<vector<int>> people;
people.reserve(k);
people.push_back(vector<int>(n1, 0));
// input
for (int _k = 1; _k < k; _k++)
{
int ni;
cin >> ni;
input.push_back(vector<int>());
input.back().reserve(ni);
people.push_back(vector<int>(ni, 0));
for (int _ni = 0; _ni < ni; _ni++)
{
int a;
cin >> a;
input.back().push_back(a);
}
if (ni > odp)
{
odp = ni;
}
}
for (int i = 0; i < people.back().size(); i++)
{
people.back()[i] = 1;
}
// solution
for (int i = k - 2; i >= 0; i--)
{
for (int j = 0; j < people[i + 1].size(); j++)
{
if (input[i + 1][j] != 0)
{
people[i][input[i + 1][j] - 1] += people[i + 1][j];
}
}
for (int j = 0; j < people[i].size(); j++)
{
if (people[i][j] == 0)
{
people[i][j] = 1;
}
}
int people_needed = 0;
for (int j = 0; j < people[i].size(); j++)
{
people_needed += people[i][j];
}
if (people_needed > odp)
{
odp = people_needed;
}
}
// cout << "people" << endl;
// for (auto p : people)
// {
// for (auto el : p)
// {
// cout << el << " ";
// }
// cout << endl;
// }
cout << odp << endl;
return 0;
}
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 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 | #include <bits/stdc++.h> #include <cstdlib> using namespace std; int main() { std::ios_base::sync_with_stdio(false); std::cin.tie(NULL); int k, n1; cin >> k >> n1; int odp = n1; vector<vector<int>> input; input.reserve(k); input.push_back(vector<int>(n1, 0)); vector<vector<int>> people; people.reserve(k); people.push_back(vector<int>(n1, 0)); // input for (int _k = 1; _k < k; _k++) { int ni; cin >> ni; input.push_back(vector<int>()); input.back().reserve(ni); people.push_back(vector<int>(ni, 0)); for (int _ni = 0; _ni < ni; _ni++) { int a; cin >> a; input.back().push_back(a); } if (ni > odp) { odp = ni; } } for (int i = 0; i < people.back().size(); i++) { people.back()[i] = 1; } // solution for (int i = k - 2; i >= 0; i--) { for (int j = 0; j < people[i + 1].size(); j++) { if (input[i + 1][j] != 0) { people[i][input[i + 1][j] - 1] += people[i + 1][j]; } } for (int j = 0; j < people[i].size(); j++) { if (people[i][j] == 0) { people[i][j] = 1; } } int people_needed = 0; for (int j = 0; j < people[i].size(); j++) { people_needed += people[i][j]; } if (people_needed > odp) { odp = people_needed; } } // cout << "people" << endl; // for (auto p : people) // { // for (auto el : p) // { // cout << el << " "; // } // cout << endl; // } cout << odp << endl; return 0; } |
English