# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
42375 | wasyl | Baza (COCI17_baza) | C++11 | 92 ms | 29980 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>
#ifndef dbg
#define dbg(...)
#endif
#define all(x) begin(x), end(x)
#define rsz(...) resize(__VA_ARGS__)
#define psh(...) push_back(__VA_ARGS__)
#define emp(...) emplace_back(__VA_ARGS__)
#define prt(...) print(cout, __VA_ARGS__)
#define dmp(...) print(cerr, #__VA_ARGS__, '=', __VA_ARGS__)
#define dprt(...) dbg(print(cerr,__VA_ARGS__))
#define ddmp(...) dbg(dmp(__VA_ARGS__))
using namespace std;using ll=long long;
template<typename t>using V=vector<t>;
template<typename t>void print(ostream& os, const t& a){os<<a<<'\n';}
template<typename t, typename... A>void print
(ostream& os, const t& a, A&&... b){os<<a<<' ';print(os, b...);}
inline bool operator== (const V< int >& a, const V< int >& b)
{
for (int i = 0; i < a.size(); ++i)
if (!(a[i] == b[i] or a[i] == -1 or b[i] == -1))
return false;
return true;
}
int n, m, q;
V< V< int > > tb;
int main()
{
ios::sync_with_stdio(false);
cin.tie(nullptr);
cin >> n >> m;
tb.rsz(n, V< int >(m));
for (auto& v : tb)
for (int& i : v)
cin >> i;
cin >> q;
for (int i = 0; i < q; ++i)
{
V< int > ilo(m);
for (int& i : ilo)
cin >> i;
int res = 0;
for (int i = 0; i < n; ++i)
if (ilo == tb[i])
++res;
prt(res);
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |