Submission #977373

#TimeUsernameProblemLanguageResultExecution timeMemory
977373vjudge1Pizza (COCI21_pizza)C++11
0 / 50
1 ms600 KiB
#include <bits/stdc++.h> using namespace std; int main() { int M, N; cin >> M >> N; vector<unordered_set<string>> bingkisan(M); for (int i = 0; i < M; ++i) { int K; cin >> K; for (int j = 0; j < K; ++j) { string camilan; cin >> camilan; bingkisan[i].insert(camilan); } } unordered_set<string> tidak_disukai; for (int i = 0; i < N; ++i) { string camilan; cin >> camilan; tidak_disukai.insert(camilan); } int jumlah_bingkisan_dapat_dibeli = 0; for (const auto& bingkisan_set : bingkisan) { bool semua_camilan_dapat_diterima = true; for (const auto& camilan : bingkisan_set) { if (tidak_disukai.count(camilan) > 0) { semua_camilan_dapat_diterima = false; break; } } if (semua_camilan_dapat_diterima) { jumlah_bingkisan_dapat_dibeli++; } } cout << jumlah_bingkisan_dapat_dibeli << endl; return 0; }
#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...