Submission #1171693

#TimeUsernameProblemLanguageResultExecution timeMemory
1171693tatasPizza (COCI21_pizza)C++20
50 / 50
0 ms328 KiB
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef vector<int> vi;

#define endl '\n'

void solve()
{
    int n;
    cin >> n;

    int a[101];
    memset(a, 0, sizeof a); // Gunakan 0 untuk inisialisasi

    for (int i = 0; i < n; i++)
    {
        int x;
        cin >> x;
        a[x] = 1; // Tandai topping yang tidak disukai
    }

    int m;
    cin >> m;
    int ans = 0;

    while (m--)
    {
        int k;
        cin >> k;
        bool ok = true;

        for (int i = 0; i < k; i++)
        {
            int x;
            cin >> x;
            if (a[x])
            {
                ok = false;
            }
        }

        if (ok)
            ans++;
    }

    cout << ans << endl;
}

int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);

    solve();
    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...