제출 #976234

#제출 시각아이디문제언어결과실행 시간메모리
976234vjudge1Pizza (COCI21_pizza)C++17
50 / 50
1 ms348 KiB
#include <bits/stdc++.h> #define ll long long #define nah_id_win ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); #define fi first #define se second using namespace std; int main(){ nah_id_win; ll n; cin >> n; ll a[n]; for(int i=0; i<n; i++) cin >> a[i]; sort(a, a+n); ll m, k, b, low, cnt=0; cin >> m; bool flag; while(m--){ flag=0; cin >> k; while(k--){ cin >> b; low=lower_bound(a, a+n, b)-a; if(a[low]==b && low<n){ flag=1; //cout << a[low] << endl; } } if(!flag) 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...