Submission #975893

#TimeUsernameProblemLanguageResultExecution timeMemory
975893vjudge1Pizza (COCI21_pizza)C++17
50 / 50
1 ms348 KiB
#include <bits/stdc++.h>

using namespace std;

int main(){
    int n; cin >> n;
    int a[n+1];
    int ans = 0;

    for(int i = 1; i <= n; i++){
        cin >> a[i];
    }

    int m; cin >> m;

    while(m--){
        int k; cin >> k;
        map<int, int> b;
        //b.clear();

        bool ada = false;
        for(int i = 1; i <= k; i++){
            int x; cin >> x;
            b[x]++;
        }
        for(int i = 1; i <= n; i++){
            if(b.count(a[i]) != 0){
                ada = true;
                break;
            }
        }
        if(!ada) ans++;
    }

    cout << ans << endl;
}
#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...