oj.uz

Submission #975095

# Submission time Handle Problem Language Result Execution time Memory
975095 2024-05-04T12:37:38 Z vjudge1 Pizza (COCI21_pizza) C++17
50 / 50
 1 ms 348 KB 
// أَعُوذُ بِاللَّهِ مِنَ الشَّيْطَانِ الرَّجِيمِ
#include <bits/stdc++.h>
#define bismillah ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define ll long long
using namespace std;

int a[101];
int b[101];
int n, m, k, count = 0;
bool isTrue;

int main(){
    bismillah
    int n, m;
    cin >> n;
    int a[n];
    for(int i = 0; i < n; i++){
        cin >> a[i];
    }
    cin >> m;
    int count = 0;
    while(m--){
        int k;
        cin >> k;
        int b[k];
        isTrue = true;
        for(int i = 0; i < k; i++){
            cin >> b[i];
            for(int j = 0; j < n; j++){
                if(b[i] == a[j]){
                    isTrue = false;
                }
        }
        }
        if(isTrue == true) count++;
    }
    cout << count;
}

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 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 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct