Submission #1247836

#	Time	Username	Problem	Language	Result	Execution time	Memory
1247836		hayyy	Pizza (COCI21_pizza)	C++20	50 / 50	0 ms	328 KiB

Main

#include <bits/stdc++.h>
using namespace std;

int main() {
  int N, M, K, X, cnt = 0, inp;
  cin >> N;

  vector<int> A(N);  // Input array A of size N
  for (int i = 0; i < N; i++) {
    cin >> A[i];
  }

  cin >> M;

  // Use a set for fast lookup
  unordered_set<int> A_set(A.begin(), A.end());

  for (int i = 0; i < M; i++) {
    cin >> K;
    bool valid = true;
    vector<int> B(K);
    for (int j = 0; j < K; j++) {
      cin >> B[j];
      if (A_set.count(B[j])) {
        valid = false;
      }
    }
    if (valid) cnt++;
  }

  cout << cnt << endl;
  return 0;
}

• Subtask 1: 10 / 10
• Subtask 2: 10 / 10
• Subtask 3: 10 / 10
• Subtask 4: 10 / 10
• Subtask 5: 10 / 10