#include #include #include #include #include #include #include #include using namespace std; int main() { int n, m; cin >> n >> m; vector parents(n + 1, 51); for (int person = 1; person <= n; person++) parents[person] = person; int knowCount; cin >> knowCount; vector knows(n + 1, false); for (int i = 0; i < knowCount; i++) { int person; cin >> person; knows[person] = true; } vector partyParents; for (int party = 0; party < m; party++) { int count; cin >> count; vector persons; for (int i = 0; i < count; i++) { int currentPerson; cin >> currentPerson; if (i == 0) persons.push_back(currentPerson); else { if (parents[currentPerson] < parents[persons[0]]) { int tmp = parents[persons[0]]; for (int person = 1; person <= n; person++) { if (parents[person] == tmp) parents[person] = parents[currentPerson]; } } else { int tmp = parents[currentPerson]; for (int person = 1; person <= n; person++) { if (parents[person] == tmp) parents[person] = parents[persons[0]]; } } } } partyParents.push_back(persons[0]); } int count = m; for (int party = 0; party < m; party++) { int parent = parents[partyParents[party]]; vector persons; for (int person = 1; person <= n; person++) { if (parents[person] == parent) persons.push_back(person); } if (persons.empty()) continue; for (int person : persons) { if (knows[person]) { count--; break; } } } cout << count; return 0; }

코드 #527