# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
976853 |
2024-05-07T07:52:38 Z |
vjudge1 |
Pizza (COCI21_pizza) |
C++17 |
|
1 ms |
500 KB |
#include <bits/stdc++.h>
#define int long long
using namespace std;
signed main(){
ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
int n, m, count = 0;
cin >> n;
vector <int> tidaksuka(n);
for (int i = 0; i < n; i++)
cin >> tidaksuka[i];
cin >> m;
while (m--){
int k, input; cin >> k;
bool dapat = true;
while (k--){
cin >> input;
for (int &i: tidaksuka){
if (input == i)
dapat = false;
}
}
if (dapat)
count++;
}
cout << count << endl;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
344 KB |
Output is correct |
2 |
Correct |
0 ms |
344 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
500 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 |
344 KB |
Output is correct |
2 |
Correct |
0 ms |
456 KB |
Output is correct |