Submission #1230806

#TimeUsernameProblemLanguageResultExecution timeMemory
1230806amawPizza (COCI21_pizza)C++20
20 / 50
1093 ms12608 KiB
#include <iostream>
using namespace std;

int main() {
    int n;
    cin >> n;
    
    int A[n];
    for (int i = 0; i < n; i++) cin >> A[i];
    
    int m;
    cin >> m;
    
    int K[m]; int B[m][K[m]];
    for (int i = 0; i < m; i++) {
        cin >> K[i];
        for (int j = 0; j < K[i]; j++) cin >> B[i][j];
    }
    
    int hasil = 0; bool cek;
    for (int i = 0; i < m; i++) { // akses nilai K
        cek = false; int temp = 0;
        
        for (int j = 0; j < K[i]; j++) { // akses nilai B
            for (int l = 0; l < n; l++) {
                if (B[i][j] == A[l]) {
                    cek = true;
                    break;
                }
                temp = j;
            }
            if (cek == true) break;
            else if (temp == K[i] - 1) {
                hasil++; break;
            }
        }
    }
    
    cout << hasil;
    
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...