This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++)
{
cin >> a[i];
}
long long cnt = 0;
int m;
cin >> m;
while (m--)
{
int k;
cin >> k;
bool like = true;
for (int i = 0; i < k; i++)
{
int tmp;
cin >> tmp;
for (int j = 0; j < n; j++)
{
if (tmp == a[j])
{
like = false;
break;
}
}
}
if (like)
cnt++;
}
cout << cnt;
}
# | 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... |