#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define ppb pop_back
#define mp make_pair
#define fi first
#define se second
#define nl '\n'
const int mod = 1e9+7;
void solve(){
int n; cin >> n;
set<int> s;
while (n--){
int x; cin >> x;
s.insert(x);
}
int m; cin >> m;
int ans = 0;
while (m--){
int k; cin >> k;
bool ok = 1;
while (k--){
int x; cin >> x;
if (s.count(x)) ok = 0;
}
if (ok) ans++;
}
cout << ans;
}
signed main (){
ios_base::sync_with_stdio(false);
cin.tie(0);
int t = 1; //cin >> t;
while (t--){
solve();
}
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Correct |
1 ms |
344 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
344 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
348 KB |
Output is correct |
2 |
Correct |
1 ms |
348 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |