oj.uz

Submission #976234

# Submission time Handle Problem Language Result Execution time Memory
976234 2024-05-06T10:33:59 Z vjudge1 Pizza (COCI21_pizza) C++17
50 / 50
 1 ms 348 KB 
#include <bits/stdc++.h>
#define ll long long
#define nah_id_win ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define fi first
#define se second
using namespace std;

int main(){
    nah_id_win;
    ll n; cin >> n;
    ll a[n];
    for(int i=0; i<n; i++)
        cin >> a[i];
    sort(a, a+n);

    ll m, k, b, low, cnt=0; cin >> m;
    bool flag;
    while(m--){
        flag=0;
        cin >> k;
        while(k--){
            cin >> b;
            low=lower_bound(a, a+n, b)-a;
            if(a[low]==b && low<n){
                flag=1;
                //cout << a[low] << endl;
            }
        }
        if(!flag) cnt++;
    }
    cout << cnt;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

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

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 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 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct