# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
976853 | vjudge1 | Pizza (COCI21_pizza) | C++17 | 1 ms | 500 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 <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 |
---|---|---|---|---|
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... |