#include <bits/stdc++.h>
#define ff first
#define ss second
#define endl '\n'
using namespace std;
const long long INF = (long long) 1e18;
const int mod = (int) 1e9+7;
const int MAXN = (int) 3e5+5;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
int n, m;
int a[1005][1005];
int main(){
ios_base::sync_with_stdio(false);
cin.tie(nullptr);cout.tie(nullptr);
#ifdef Local
freopen("C:/Users/Admin/Desktop/Yazilim/C/IO/int.txt","r",stdin);
freopen("C:/Users/Admin/Desktop/Yazilim/C/IO/out.txt","w",stdout);
#endif
cin>>n>>m;
for(int i = 0; i < n; i++)
for(int j = 0; j < m; j++)
cin>>a[i][j];
int q;
cin>>q;
while(q--){
vector<int> Q(m);
for(int i = 0; i < m; i++)
cin>>Q[i];
int ans = 0;
for(int i = 0; i < n; i++){
bool es = 1;
for(int j = 0; j < m; j++)
es = (es && (Q[j] == -1 || Q[j] == a[i][j]));
ans += es;
}
cout<<ans<<endl;
}
#ifdef Local
cout<<endl<<fixed<<setprecision(2)<<1000.0 * clock() / CLOCKS_PER_SEC<< " milliseconds ";
#endif
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
25 ms |
2924 KB |
Output is correct |
2 |
Correct |
18 ms |
2668 KB |
Output is correct |
3 |
Correct |
59 ms |
7404 KB |
Output is correct |
4 |
Correct |
14 ms |
2412 KB |
Output is correct |
5 |
Correct |
38 ms |
4332 KB |
Output is correct |
6 |
Correct |
64 ms |
6764 KB |
Output is correct |
7 |
Correct |
92 ms |
9068 KB |
Output is correct |
8 |
Correct |
52 ms |
5612 KB |
Output is correct |
9 |
Correct |
33 ms |
5484 KB |
Output is correct |
10 |
Correct |
77 ms |
7916 KB |
Output is correct |