제출 #976058

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