oj.uz

Submission #1055375

# Submission time Handle Problem Language Result Execution time Memory
1055375 2024-08-12T18:27:38 Z fryingduc Pizza (COCI21_pizza) C++17
50 / 50
 0 ms 348 KB 
#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;
}

Subtask #1
10.0 / 10.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

Subtask #2
10.0 / 10.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

Subtask #2
10.0 / 10.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

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct

Subtask #5
10.0 / 10.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