#include <cstdio>
#include <stdio.h>
#include <stdbool.h>
#include <iostream>
#include <map>
#include <vector>
#include <climits>
#include <stack>
#include <string>
#include <queue>
#include <algorithm>
#include <set>
#include <unordered_set>
#include <unordered_map>
#include <cmath>
#include <cctype>
#include <bitset>
#include <iomanip>
#include <cstring>
#include <numeric>
#include <cassert>
#include <random>
#include <chrono>
#include <fstream>
using namespace std;
#define int long long
#define pii pair<int, int>
#define mp make_pair
#define pb push_back
#define fi first
#define se second
int32_t main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n, m, q;
cin>>n>>m;
vector<vector<int> > vect(n, vector<int>(m));
for (int i=0; i<n; ++i)for (int j=0; j<m; ++j)cin>>vect[i][j];
cin>>q;
while (q--){
int ans=0;
vector<int> a(m);
for (int i=0; i<m; ++i)cin>>a[i];
for (int i=0; i<n; ++i){
bool can=1;
for (int j=0; j<m; ++j)if (a[j]!=-1&&vect[i][j]!=a[j])can=0;
ans+=can;
}
cout<<ans<<"\n";
}
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |