제출 #973572

#제출 시각아이디문제언어결과실행 시간메모리
973572vjudge1Pizza (COCI21_pizza)C++98
0 / 50
1 ms348 KiB
#include<bits/stdc++.h> using namespace std; int main(){ int n,m; bool bisa = true; int cnt = 0; cin >> n; int a[101], k[101], b[101]; for(int i = 1; i <= n; i++){ cin >> a[i]; } cin >> m; for(int i = 1; i <= m; i++){ cin >> k[i]; for(int j = 1; j <= k[i]; j++){ cin >> b[j]; } } for(int i = 1; i <= n; i++){ for(int j = 1; j <= k[i]; j++){ if(a[i] == b[j]) bisa = false; break; } if(!bisa) break; if(bisa) cnt++; } cout << cnt; }
#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...