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,M;
cin>>N;
int A[N];
for (int i = 0; i < N; i++)
{
cin>>A[i];
}
cin>>M;
int ans=0;
while (M--)
{
int k;
cin>>k;
int B[k];
for (int i = 0; i < k; i++)
{
cin>>B[i];
}
int sama=0;
for (int i = 0; i < k; i++)
{
for (int j = 0; j < N; j++)
{
if(A[j]==B[i]){
sama++;
}
}
}
if(sama==0){
ans++;
}
}
cout<<ans;
}
# | 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... |