| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 241008 | SamAnd | Baza (COCI17_baza) | C++17 | 127 ms | 9080 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;
#define m_p make_pair
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define fi first
#define se second
typedef long long ll;
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
mt19937 rnf(2106);
const int N = 1003;
int n, m;
int a[N][N];
int b[N];
void solv()
{
    scanf("%d%d", &n, &m);
    for (int i = 1; i <= n; ++i)
    {
        for (int j = 1; j <= m; ++j)
        {
            scanf("%d", &a[i][j]);
        }
    }
    int qq;
    scanf("%d", &qq);
    while (qq--)
    {
        for (int i = 1; i <= m; ++i)
            scanf("%d", &b[i]);
        int ans = 0;
        for (int i = 1; i <= n; ++i)
        {
            bool z = true;
            for (int j = 1; j <= m; ++j)
            {
                if (b[j] == -1)
                    continue;
                if (a[i][j] != b[j])
                {
                    z = false;
                    break;
                }
            }
            ans += z;
        }
        printf("%d\n", ans);
    }
}
int main()
{
    #ifdef SOMETHING
    freopen("input.txt", "r", stdin);
    //freopen("output.txt", "w", stdout);
    #endif // SOMETHING
    //ios_base::sync_with_stdio(false), cin.tie(0);
    solv();
    return 0;
}
//while ((double)clock() / CLOCKS_PER_SEC <= 0.9){}
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
