#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int k, n1;
cin >> k >> n1;
vector<vector<int>> prv(k);
prv[0].resize(n1);
for (int i = 1; i < k; ++i) {
int n;
cin >> n;
prv[i].resize(n);
for (auto& a : prv[i]) {
cin >> a;
}
}
vector<int> cnt(prv.back().size(), 1);
int ans = (int)cnt.size();
for (int i = k - 1; i > 0; --i) {
vector<int> prv_cnt(prv[i - 1].size());
for (int j = 0; j < (int)prv[i].size(); ++j) {
if (prv[i][j] > 0) {
prv_cnt[prv[i][j] - 1] += cnt[j];
}
}
cnt = prv_cnt;
int curr = 0;
for (auto& c : cnt) {
c = max(1, c);
curr += c;
}
ans = max(ans, curr);
}
cout << ans << '\n';
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 | #include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); int k, n1; cin >> k >> n1; vector<vector<int>> prv(k); prv[0].resize(n1); for (int i = 1; i < k; ++i) { int n; cin >> n; prv[i].resize(n); for (auto& a : prv[i]) { cin >> a; } } vector<int> cnt(prv.back().size(), 1); int ans = (int)cnt.size(); for (int i = k - 1; i > 0; --i) { vector<int> prv_cnt(prv[i - 1].size()); for (int j = 0; j < (int)prv[i].size(); ++j) { if (prv[i][j] > 0) { prv_cnt[prv[i][j] - 1] += cnt[j]; } } cnt = prv_cnt; int curr = 0; for (auto& c : cnt) { c = max(1, c); curr += c; } ans = max(ans, curr); } cout << ans << '\n'; return 0; } |
English