# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1055375 | fryingduc | Pizza (COCI21_pizza) | C++17 | 0 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;
typedef long long ll;
int n, m, a[105], k[105], ans;
void solve(){
cin >> n;
for(int i=0;i<n;i++) cin >> a[i];
sort(a, a+n);
cin >> m;
for(int i=0;i<m;i++){
int x, f=1; cin >> x;
for(int i=0;i<x;i++){
int y; cin >> y;
int lb = lower_bound(a, a+n, y)-a;
if(a[lb]==y) f=0;
}
ans += f;
}
cout << ans;
}
int32_t main(){
cin.tie(0)->sync_with_stdio(0);
solve();
return 0;
}
# | 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... |