# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
973725 |
2024-05-02T10:11:38 Z |
vjudge1 |
Pizza (COCI21_pizza) |
C++17 |
|
1 ms |
460 KB |
// #include <iostream>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, m, counter = 0;
bool a[110];
cin >> n;
memset(a, 0, sizeof(a));
for (int i = 0; i < n; i++)
{
int b;
cin >> b;
a[b] = true;
}
cin >> m;
for (int i = 0; i < m; i++)
{
int k;
cin >> k;
bool take = true;
for (int j = 0; j < k; j++)
{
int b;
cin >> b;
if (a[b])
take = false;
}
if(take)
counter++;
}
cout << counter;
return 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 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
460 KB |
Output is correct |
2 |
Correct |
1 ms |
348 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
348 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Correct |
1 ms |
344 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
348 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |