Submission #976468

#TimeUsernameProblemLanguageResultExecution timeMemory
976468vjudge1Pizza (COCI21_pizza)C++17
50 / 50
1 ms540 KiB
#include <iostream> #include <vector> #include <cstring> using namespace std; typedef long long ll; bool tidak[1000]; int main() { memset(tidak, 0, sizeof(tidak)); int n; cin >> n; for (int i = 0; i < n; i++) { int a; cin >> a; tidak[a] = 1; } int m; cin >> m; int cnt = 0; for (int i = 0; i < m; i++) { int k; cin >> k; bool ambil = 1; for (int j = 0; j < k; j++) { int b; cin >> b; if (tidak[b]) ambil = 0; } if (ambil) cnt++; } cout << cnt << endl; }
#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...