# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
143976 | 44442 | Baza (COCI17_baza) | C++11 | 272 ms | 9464 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
int n,m,q,a[1004][1004],b[60][1004],ok,v[60][1004];
int main (){
ios::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
cin>>n>>m;
for(int i=0;i<n;i++){
for(int j=0;j<m;j++){
cin>>a[i][j];
}
}
cin>>q;
for(int d=0;d<q;d++){
for(int j=0;j<m;j++){
cin>>b[d][j];
}
}
for(int d=0;d<q;d++){
ok=0;
for(int i=0;i<n;i++){
for(int j=0;j<m;j++){
if(b[d][j]!=-1){
if(!v[d][i] and a[i][j]!=b[d][j])
v[d][i]=1;
}
}
if(!v[d][i])
ok++;
}
cout<<ok<<endl;
}
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |