oj.uz

Submission #973430

# Submission time Handle Problem Language Result Execution time Memory
973430 2024-05-02T01:57:56 Z vjudge1 Pizza (COCI21_pizza) C++17
50 / 50
 1 ms 348 KB 
#include <bits/stdc++.h>
#define ll long long

using namespace std;

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

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

    int m;
    cin >> m;
    set<int> s[m + 1];
    for (int i = 1; i <= m; i++)
    {
        int k;
        cin >> k;
        for (int j = 1; j <= k; j++)
        {
            int x;
            cin >> x;
            s[i].insert(x);
        }
    }

    int ans = 0;
    for (int i = 1; i <= m; i++)
    {
        bool exist = false;
        for (int j = 1; j <= n; j++)
        {
            if (s[i].count(a[j]))
            {
                exist = true;
                break;
            }
        }
        if (!exist)
        {
            // cout << " a " << i << " a " << endl;
            ans++;
        }
    }
    cout << ans << endl;

    return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct