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;
#define FOR(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
#define sqr(x) ((ll)(x))*(x)
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
int N, M;
set<int> dis;
int main() {
cin.tie(0)->sync_with_stdio(0);
cin >> N;
FOR(i, 0, N) {
int a; cin >> a; dis.insert(a);
}
cin >> M;
int good = 0;
FOR(i, 0, M) {
bool failed = false;
int k; cin >> k; FOR(_k, 0, k){
int f; cin >> f; if (dis.count(f)) failed = true;
}
if (!failed) good++;
}
cout << good;
}
# | 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... |