#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";
}
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
50 ms |
2936 KB |
Output is correct |
2 |
Correct |
30 ms |
2816 KB |
Output is correct |
3 |
Correct |
152 ms |
7672 KB |
Output is correct |
4 |
Correct |
24 ms |
2560 KB |
Output is correct |
5 |
Correct |
75 ms |
4472 KB |
Output is correct |
6 |
Correct |
156 ms |
7032 KB |
Output is correct |
7 |
Correct |
245 ms |
9464 KB |
Output is correct |
8 |
Correct |
114 ms |
5880 KB |
Output is correct |
9 |
Correct |
63 ms |
5880 KB |
Output is correct |
10 |
Correct |
192 ms |
8184 KB |
Output is correct |