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;
bool isLiked;
int n, a[101], m, k, b[101], ans;
int main(){
cin >> n;
for (int i = 0; i < n; i++){
cin >> a[i];
}
sort (a, a+n);
cin >> m;
for (int i = 0; i < m; i++){
isLiked = true;
cin >> k;
for (int j = 0; j < k; j++){
cin >> b[j];
}
sort(b, b+k);
int idx = 0;
for (int j = 0; j < k; j++){
while (b[j] > a[idx] && a[idx] != 0){
idx++;
}
if (a[idx] == 0){
break;
}
if (b[j] == a[idx]){
isLiked = false;
break;
}
}
if (isLiked == true){
ans++;
}
}
cout << ans;
return 0;
}
# | 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... |