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+1];
int ans = 0;
for(int i = 1; i <= n; i++){
cin >> a[i];
}
int m; cin >> m;
while(m--){
int k; cin >> k;
//int b[k+1];
map<int, int> b;
//memset(b, -1, sizeof b);
b.clear();
bool ada = false;
for(int i = 1; i <= k; i++){
int x; cin >> x;
b[x]++;
}
for(int i = 1; i <= n; i++){
//for(int j = 1; j <= k; j++){
// if(a[i] == b[j])
//}
//cout << b.count(a[i]) << " ";
if(b.count(a[i]) != 0){
ada = true;
break;
}
}
//cout << endl << ada << endl;
//cout << ans << endl;
if(!ada) ans++;
}
cout << ans << endl;
}
# | 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... |