oj.uz

Submission #976058

# Submission time Handle Problem Language Result Execution time Memory
976058 2024-05-06T06:45:38 Z vjudge1 Pizza (COCI21_pizza) C++17
50 / 50
 1 ms 348 KB 
#include <bits/stdc++.h>
using namespace std;

int n, a[105], m, k[105], b[105][105];
bool buang;
int bingkisan = 0;

int main() {
  ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
  cin >> n;
  for (int i = 0; i < n; i++) {
    cin >> a[i];
  }
  cin >> m;
  for (int i = 0; i < m; i++) {
    cin >> k[i];
    for (int j = 0; j < k[i]; j++) {
      cin >> b[i][j];
    }
  }
  for (int i = 0; i < m; i++) {
    buang = false;
    for (int l = 0; l < n; l++) {
      for (int j = 0; j < k[i]; j++) {
        if (a[l] == b[i][j]) {
          buang = true;
        }
      }
      if (buang) {
        break;
      }
    }
    if (buang == false) {
      bingkisan++;
    }
  }
  cout << bingkisan << endl;
  return 0;
}

Subtask #1
10.0 / 10.0

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