제출 #975090

#제출 시각아이디문제언어결과실행 시간메모리
975090vjudge1Pizza (COCI21_pizza)C++17
50 / 50
1 ms392 KiB
#include <bits/stdc++.h> using namespace std; int main(){ int n; cin >> n; int a[n+1]; int ans = 0; for(int i = 1; i <= n; i++){ cin >> a[i]; } int m; cin >> m; while(m--){ int k; cin >> k; //int b[k+1]; map<int, int> b; //memset(b, -1, sizeof b); b.clear(); bool ada = false; for(int i = 1; i <= k; i++){ int x; cin >> x; b[x]++; } for(int i = 1; i <= n; i++){ //for(int j = 1; j <= k; j++){ // if(a[i] == b[j]) //} //cout << b.count(a[i]) << " "; if(b.count(a[i]) != 0){ ada = true; break; } } //cout << endl << ada << endl; //cout << ans << endl; if(!ada) ans++; } cout << ans << 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...