# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
292454 | 7_7_7 | Baza (COCI17_baza) | C++17 | 233 ms | 7988 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;
int m;
int main()
{
ios_base::sync_with_stdio(false);
cin >> n >> m;
vector<vector<int>> a(n, vector<int>(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> t(m);
for(auto &x: t) cin >> x;
int res = 0;
for(int i = 0; i < n; i ++){
int good = 1;
for(int j = 0; j < m; j ++){
if(t[j] == -1) continue;
good &= (t[j] == a[i][j]);
}
res += good;
}
cout << res << "\n";
}
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |