oj.uz

답안 #249469

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
249469 2020-07-15T06:10:12 Z Vimmer Baza (COCI17_baza) C++14
50 / 50
 82 ms 7800 KB 
#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.0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 27 ms 2688 KB Output is correct
2 Correct 17 ms 1912 KB Output is correct
3 Correct 51 ms 5112 KB Output is correct
4 Correct 13 ms 1536 KB Output is correct
5 Correct 40 ms 4088 KB Output is correct
6 Correct 60 ms 5880 KB Output is correct
7 Correct 82 ms 7800 KB Output is correct
8 Correct 52 ms 4988 KB Output is correct
9 Correct 31 ms 3064 KB Output is correct
10 Correct 81 ms 7712 KB Output is correct