| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1247008 | amaw | Pizza (COCI21_pizza) | C++20 | 1 ms | 328 KiB |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 100;
int n, m;
set<int> A;
int main() {
cin >> n;
for (int i = 0; i < n ; i++) {
int x;
cin >> x;
A.insert(x);
}
cin >> m;
int sum = 0;
for (int i = 0; i < m; i++) {
int y;
cin >> y;
bool cek = true;
for (int j = 0; j < y; j++) {
int x;
cin >> x;
if (A.count(x)) cek = false;
}
if (cek) sum++;
}
cout << sum;
}| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
