제출 #249911

#제출 시각아이디문제언어결과실행 시간메모리
249911NONAMEBaza (COCI17_baza)C++14
50 / 50
245 ms9464 KiB
#include  <bits/stdc++.h>
#define dbg(x) cerr << #x << " = " << x << "\n"
#define fast_io ios_base::sync_with_stdio(0); cin.tie(0); cout.tie()
using namespace std;
using ll = long long;
using ld = long double;

int n, m, q, a[1100][1100], b[1100];

int f() {
    int k = 0;
    for (int i = 0; i < n; ++i) {
        bool gd = 1;
        for (int j = 0; j < m; ++j)
            gd &= (b[j] == -1 || (b[j] == a[i][j]));
        k += gd;
    }
    return k;
}

int main() {
    fast_io;

    cin >> n >> m;
    for (int i = 0; i < n; ++i)
    for (int j = 0; j < m; ++j)
        cin >> a[i][j];

    cin >> q;
    while (q--) {
        for (int i = 0; i < m; ++i)
            cin >> b[i];

        cout << f() << "\n";
    }
}
#Verdict Execution timeMemoryGrader output
Fetching results...