Submission #971290

#TimeUsernameProblemLanguageResultExecution timeMemory
971290vjudge1Pizza (COCI21_pizza)C++17
30 / 50
1 ms436 KiB
#include<bits/stdc++.h> using namespace std; #define int long long signed main(){ int n; cin>>n; int larang[n+1]; for(int t=1;t<=n;t++){ cin>>larang[t]; } int cnt=0; int tc; cin>>tc; while(tc--){ int a; cin>>a; int angka[a+1]; for(int d=1;d<=a;d++){ cin>>angka[d]; } bool hmm=true; for(int y=1;y<=n;y++){ int l=1,r=a; while(l<=r){ int mid=(l+r)/2; if(angka[mid]<larang[y]){ l=mid+1; } else if(angka[mid]>larang[y]){ r=mid-1; } else{ hmm=false; break; } } if(hmm==false){ break; } } if(hmm==true)cnt++; } cout<<cnt<<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...