#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
#define endl '\n'
void solve()
{
int n;
cin >> n;
unordered_set<int> disliked;
for (int i = 0; i < n; i++)
{
int x;
cin >> x;
disliked.insert(x); // Menggunakan unordered_set untuk akses O(1)
}
int m, ans = 0;
cin >> m;
while (m--)
{
int k;
cin >> k;
bool ok = true;
for (int i = 0; i < k; i++)
{
int x;
cin >> x;
if (disliked.count(x)) // Cek dalam O(1) dengan unordered_set
{
ok = false;
}
}
if (ok)
ans++;
}
cout << ans << endl;
}
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
solve();
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... |