제출 #975405

#제출 시각아이디문제언어결과실행 시간메모리
975405vjudge1Pizza (COCI21_pizza)C++17
50 / 50
1 ms348 KiB
#include <bits/stdc++.h> using namespace std; #define int long long #define Foxfur ios_base::sync_with_stdio(0);cin.tie(NULL); int32_t main() { Foxfur int n; cin >> n; vector <bool> v(101,false); for(int i=0; i<n; i++) { int x; cin >> x; v[x] = true; } int m; cin >> m; int ans=0; for(int i=0; i<m; i++) { int k; cin >> k; int bingkisan[k]; bool flag = true; for(int j=0; j<k; j++) { cin >> bingkisan[j]; } for(int j=0; j<k; j++) { if(v[bingkisan[j]] == true) { flag = false; break; } } if(flag) { 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...