# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
171639 | ToniB | Baza (COCI17_baza) | C++14 | 737 ms | 7944 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 <iostream>
#include <algorithm>
#include <string>
using namespace std;
int main(){
int n, m;
cin >> n >> m;
int r[n][m] = {0};
for(int i = 0; i < n; ++i){
for(int j = 0; j < m; ++j){
cin >> r[i][j];
}
}
int q;
cin >> q;
int sol[q] = {0};
for(int i = 0; i < q; ++i){
///////////////////////
int all[m] = {0};
for(int j = 0; j < m; ++j){
cin >> all[j];
}
int sv[n] = {0};
int log = 0;
for(int j = 0; j < m; ++j){
if(all[j] < 0){
log += 1;
continue;
}
else{
for(int k = 0; k < n; ++k){
if(r[k][j] == all[j]) sv[k] += 1;
}
}
}
for(int j = 0; j < n; ++j){
sv[j] += log;
}
for(int j = 0; j < n; ++j){
if(sv[j] == m) sol[i]++;
}
}
for(int i = 0; i < q; ++i){
cout << sol[i] << endl;
}
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |