| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1255214 | bonic | Pizza (COCI21_pizza) | C++20 | 1 ms | 328 KiB |
#include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
int n; cin >> n; set<int> A;
for (int i = 0; i < n; i++) {
int x; cin >> x; A.insert(x);
}
int m; cin >> m; int sum = 0;
while (m--) {
int x; cin >> x; bool can = true;
for (int i = 0; i < x; i++) {
int y; cin >> y;
if (A.find(y) != A.end()) {
can = false;
}
}
if (can) {
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... | ||||
