#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> dislike(n);
for (int i = 0; i < n; i++) {
cin >> dislike[i];
}
// Store disliked toppings in a set for fast lookup
unordered_set<int> bad(dislike.begin(), dislike.end());
int m;
cin >> m;
int countGood = 0;
for (int i = 0; i < m; i++) {
int k;
cin >> k;
bool hasBad = false;
for (int j = 0; j < k; j++) {
int topping;
cin >> topping;
if (bad.count(topping)) {
hasBad = true;
}
}
if (!hasBad) {
countGood++;
}
}
cout << countGood << "\n";
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |