Submission #975218

#TimeUsernameProblemLanguageResultExecution timeMemory
975218vjudge1Pizza (COCI21_pizza)C++17
0 / 50
1083 ms496 KiB
#include<bits/stdc++.h> #define pii pair<int,int> #define fi first #define se second using namespace std; const int maxn=1e5+5; int main() { int n,ans=0; cin>>n; multiset<int>a; for(int i=0; i<n; i++) { int b; cin>>b; a.insert(b); } int m; cin>>m; for(int i=0; i<m; i++) { bool pos=true; int k; cin>>k; while(k--) { int c; cin>>c; if(a.find(c) != a.end()) { pos=false; break; } } if(pos) ++ans; } cout<<ans+1; }
#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...