# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
976468 | vjudge1 | Pizza (COCI21_pizza) | C++17 | 1 ms | 540 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <iostream>
#include <vector>
#include <cstring>
using namespace std;
typedef long long ll;
bool tidak[1000];
int main() {
memset(tidak, 0, sizeof(tidak));
int n; cin >> n;
for (int i = 0; i < n; i++) {
int a; cin >> a;
tidak[a] = 1;
}
int m; cin >> m;
int cnt = 0;
for (int i = 0; i < m; i++) {
int k; cin >> k;
bool ambil = 1;
for (int j = 0; j < k; j++) {
int b; cin >> b;
if (tidak[b]) ambil = 0;
}
if (ambil) cnt++;
}
# | 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... |