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>
#define ll long long
#define pb push_back
#define all(v) v.begin(),v.end()
#define forn(i,n) for(int i = 1; i<=n; i++)
using namespace std;
int main(){
ll n,m;
cin >> n;
ll arr[n+99];
forn(i,n)cin>>arr[i];
cin >> m;
set<ll> bingkisan[m+99];
forn(i,m){
ll x;
cin >> x;
forn(j,x){
ll k;
cin >> k;
bingkisan[i].insert(k);
}
}
ll bisa = m;
forn(i,m){
forn(j,n){
if(bingkisan[i].find(arr[j]) != bingkisan[i].end()){
bisa--;
break;
}
}
}
cout<<bisa;
}
# | 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... |