Submission #81985

#TimeUsernameProblemLanguageResultExecution timeMemory
81985VasiljkoBaza (COCI17_baza)C++14
50 / 50
141 ms30344 KiB
#include <bits/stdc++.h> using namespace std; typedef long long ll; const ll MOD = 1e9+7; const int N = 1e3+5; int n,m,a[N][N],b[N],q,ans; int main() { ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0); cin>>n>>m; for(int i=1;i<=n;i++)for(int j=1;j<=m;j++)cin>>a[i][j]; cin>>q; while(q--){ for(int i=1;i<=m;i++){ cin>>b[i]; } ans=0; for(int i=1;i<=n;i++){ bool ok=true; for(int j=1;j<=m;j++){ if(b[j]==-1)continue; if(b[j]!=a[i][j])ok=false; } if(ok)ans++; } cout<<ans<<"\n"; } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...