oj.uz

Submission #866883

# Submission time Handle Problem Language Result Execution time Memory
866883 2023-10-27T09:15:34 Z sleepntsheep Pizza (COCI21_pizza) C++17
50 / 50
 1 ms 464 KB 
#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;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 464 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 460 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 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct

Subtask #5
10.0 / 10.0

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