Submission #866883

#TimeUsernameProblemLanguageResultExecution timeMemory
866883sleepntsheepPizza (COCI21_pizza)C++17
50 / 50
1 ms464 KiB
#include <cstdio>
#include <cstring>
#include <cassert>
#include <string>
#include <deque>
#include <vector>
#include <map>
#include <queue>
#include <algorithm>
#include <iostream>
#include <utility>
using namespace std;
using ll = long long;
using ld = long double;
#define ShinLena cin.tie(nullptr)->sync_with_stdio(false)

#define N 105
#define ALL(x) x.begin(), x.end()

int z,m, n, a[N];

int main()
{
    ShinLena;
    cin >> n;
    for (int x, i = 1; i <= n; ++i) cin >> x, a[x] = 1;
    for (cin >> m; m--;)
    {
        int b, c=1; cin >> b;
        for (int x; b--;) cin >> x, c &= !a[x];
        z +=c;
    }
    cout<<z;



    return 0;
}


#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...