oj.uz

Submission #991187

# Submission time Handle Problem Language Result Execution time Memory
991187 2024-06-01T14:14:47 Z vjudge1 Pizza (COCI21_pizza) C++17
50 / 50
 1 ms 600 KB 
#include <bits/stdc++.h>
using namespace std;

//1.

void bingkisan(){
    int n,m,k,b;
    cin >> n;
    int a[n];
    int ans = 0;
    bool bingkis = true;
    for(int i = 0; i<n; i++){
        cin >> a[i];
    }
    cin >> m;
    for(int i = 0; i<m; i++){
        bingkis = true;
        cin >> k;
        for(int j = 0; j<k; j++){
            cin >> b;
            for(int z = 0; z<n; z++){
                if(b==a[z]){
                    bingkis = false;
                }
            }
        }
        if(bingkis){
            ans++;
        }
    }
    cout << ans << endl;
}

int main(){
    bingkisan();
}

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 600 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 1 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 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 0 ms 344 KB Output is correct