Submission #203942

#TimeUsernameProblemLanguageResultExecution timeMemory
203942awlintqaaBaza (COCI17_baza)C++14
50 / 50
94 ms9080 KiB
#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; } }
#Verdict Execution timeMemoryGrader output
Fetching results...