//Solution by Mikołaj Kołek
#include "bits/stdc++.h"
#define intin *istream_iterator<int>(cin)
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int k = intin;
vector<vector<int>> meetings(k);
meetings[0] = vector<int>(intin);
for(int i = 1; i < k; i++) {
meetings[i] = vector<int>(intin);
copy_n(istream_iterator<int>(cin), meetings[i].size(), meetings[i].begin());
}
int overflow = 0;
vector<int> requirements(meetings[k - 1].size(), 1);
for(int i = k - 1; i >= 0; i--) {
vector<int> nextRequirements(i > 0 ? meetings[i - 1].size() : 0);
for(int j = 0; j < meetings[i].size(); j++) {
if(meetings[i][j] != 0)
nextRequirements[meetings[i][j] - 1] += requirements[j];
else
overflow += requirements[j];
}
for(auto &nextReq : nextRequirements) {
if(nextReq == 0) {
nextReq = 1;
if(overflow > 0)
overflow--;
}
}
requirements = nextRequirements;
}
cout << overflow;
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 | //Solution by Mikołaj Kołek #include "bits/stdc++.h" #define intin *istream_iterator<int>(cin) using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); int k = intin; vector<vector<int>> meetings(k); meetings[0] = vector<int>(intin); for(int i = 1; i < k; i++) { meetings[i] = vector<int>(intin); copy_n(istream_iterator<int>(cin), meetings[i].size(), meetings[i].begin()); } int overflow = 0; vector<int> requirements(meetings[k - 1].size(), 1); for(int i = k - 1; i >= 0; i--) { vector<int> nextRequirements(i > 0 ? meetings[i - 1].size() : 0); for(int j = 0; j < meetings[i].size(); j++) { if(meetings[i][j] != 0) nextRequirements[meetings[i][j] - 1] += requirements[j]; else overflow += requirements[j]; } for(auto &nextReq : nextRequirements) { if(nextReq == 0) { nextReq = 1; if(overflow > 0) overflow--; } } requirements = nextRequirements; } cout << overflow; return 0; } |
English