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;
bool bisa = true;
int cnt = 0;
cin >> n;
int a[101], k[101], b[101];
for(int i = 1; i <= n; i++){
cin >> a[i];
}
cin >> m;
for(int i = 1; i <= m; i++){
cin >> k[i];
for(int j = 1; j <= k[i]; j++){
cin >> b[j];
}
}
for(int i = 1; i <= n; i++){
for(int j = 1; j <= k[i]; j++){
if(a[i] == b[j]) bisa = false;
break;
}
if(bisa) 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... |