Submission #974879

#TimeUsernameProblemLanguageResultExecution timeMemory
974879vjudge1Pizza (COCI21_pizza)C++17
50 / 50
1 ms348 KiB
#include <bits/stdc++.h> using namespace std; int n, m; string s; void solve() { cin >> n; bool bingkisan[200]; memset(bingkisan, 1, sizeof(bingkisan)); int x; for (int i = 0; i < n; i++) { cin >> x; bingkisan[x] = false; } cin >> m; int k = 0, ans = 0, no; bool valid = true; while (m--) { cin >> k; valid = true; while (k--) { cin >> no; if (!bingkisan[no]) { valid = false; } } if (valid) { ans++; } } cout << ans; } int main() { int t = 1; // cin >> t; while (t--) { solve(); } }
#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...