#define fast ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#include <bits/stdc++.h>
using namespace std;
#define sqr 200
#define mid (l+r)/2
#define pb push_back
#define ppb pop_back
#define fi first
#define se second
#define lb lower_bound
#define ub upper_bound
#define ins insert
#define era erase
#define C continue
#define mem(dp,i) memset(dp,i,sizeof(dp))
#define mset multiset
typedef long long ll;
typedef short int si;
typedef long double ld;
typedef pair<int,int> pi;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pi> vpi;
typedef vector<pll> vpll;
const ll mod=1e9+7;
const ll inf= 4e18;
const ld pai=acos(-1);
int n ,m ;
int a[1009][1009];
int b[1009];
int main () {
fast;
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-- ) {
for(int i=0;i<m;i++){
cin>>b[i];
}
int ans =0 ;
for(int i=0;i< n; i ++ ){
int crnt = 1;
for ( int j =0 ;j < m ;j ++ ) {
if ( b[j] == -1 ) C;
if ( a[i][j] != b[j] ) {
crnt =0 ;
break;
}
}
ans += crnt ;
}
cout << ans << endl;
}
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
32 ms |
2936 KB |
Output is correct |
2 |
Correct |
23 ms |
2680 KB |
Output is correct |
3 |
Correct |
64 ms |
7284 KB |
Output is correct |
4 |
Correct |
18 ms |
2424 KB |
Output is correct |
5 |
Correct |
50 ms |
4472 KB |
Output is correct |
6 |
Correct |
66 ms |
6776 KB |
Output is correct |
7 |
Correct |
93 ms |
9080 KB |
Output is correct |
8 |
Correct |
58 ms |
5624 KB |
Output is correct |
9 |
Correct |
40 ms |
5528 KB |
Output is correct |
10 |
Correct |
94 ms |
7928 KB |
Output is correct |