제출 #249469

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
249469		Vimmer	Baza (COCI17_baza)	C++14	50 / 50	82 ms	7800 KiB

baza

#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>

//#pragma GCC optimize("unroll-loops")
//#pragma GCC optimize("-O3")
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("fast-math")
//#pragma GCC optimize("no-stack-protector")

#define F first
#define S second
#define sz(x) int(x.size())
#define pb push_back
#define pf push_front
#define N 100010
#define M ll(1e9 + 7)
#define inf 1e9 + 1e9

using namespace std;
//using namespace __gnu_pbds;

typedef long double ld;
typedef long long ll;
typedef short int si;
typedef array <int, 6> a6;

//typedef tree <int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;


int main()
{
    //freopen("input.txt", "r", stdin); freopen("output4.txt", "w", stdout);

    ios_base::sync_with_stdio(0); istream::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int n, m;

    cin >> n >> m;

    int a[n][m];

    for (int i = 0; i < n; i++)
        for (int j = 0; j < m; j++) cin >> a[i][j];

    int q;

    cin >> q;

    for (; q > 0; q--)
    {
        int b[m];

        for (int i = 0; i < m; i++) cin >> b[i];

        int ans = 0;

        for (int i = 0; i < n; i++)
        {
            bool gd = 1;

            for (int j = 0; j < m; j++)
            {
                if (b[j] == -1) continue;

                if (a[i][j] != b[j]) {gd = 0; break;}
            }

            if (gd) ans++;
        }

        cout << ans << '\n';
    }
}

• Subtask 1: 50 / 50