oj.uz

Submission #1017173

# Submission time Handle Problem Language Result Execution time Memory
1017173 2024-07-09T05:33:46 Z vjudge1 Pizza (COCI21_pizza) C++17
50 / 50
 1 ms 348 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long

const int mod = 1e9+7;

signed main(){
    int n; cin >> n;
    unordered_map<int, int> a;
    for(int i = 0; i < n; i++){
        int u; cin >> u;
        a[u] = i;
    }
    
    int m; cin >> m;
    int cnt = 0;
    for(int i = 0; i < m; i++){
        int k; cin >> k;
        bool ada = false;
        vector<int> b(k);
        for(int j = 0; j < k; j++){
            cin >> b[j];
        }
        
        for(int j = 0; j < k; j++){
            if(a.find(b[j]) != a.end()){
                ada = true;
                break;
            }
        }
        
        if(!ada) cnt++;
    }
    
    cout << cnt;
}

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 344 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 1 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