# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
975489 | vjudge1 | Pizza (COCI21_pizza) | C++17 | 1 ms | 348 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>
using namespace std;
#define ll long long
int main(){
ll n, m, ans = 0; cin >> n;
vector<ll> v(n);
for(ll i = 0; i < n; i++){
cin >> v[i];
}
cin >> m;
while(m--){
ll x;
cin >> x;
bool ok = true;
unordered_set<ll> s;
for(ll i = 0; i < x; i++){
ll c;
cin >> c;
s.insert(c);
}
for(auto &i : v){
if(s.find(i) != s.end()){
ok = false;
break;
}
}
if(ok) ans++;
}
cout << ans;
# | 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... |