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(){
long long n, m;
cin >> n;
bool ts[101];
memset(ts, false, sizeof(ts));
long long t;
for(int i = 0; i < n; i++){
cin >> t;
ts[t] = true;
}cin >> m;
long long k, ans = 0;
for(int i = 0; i < m; i++){
cin >> k;
long long c[k];
bool cek = true;
for(int j = 0; j < k; j++){
cin >> c[j];
}for(int j = 0; j < k; j++){
if(ts[c[j]] == true){
cek = false;
break;
}
}
if(cek == true){
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... |