제출 #168088

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
168088		sans	Baza (COCI17_baza)	C++14	50 / 50	88 ms	7928 KiB

baza

#include <iostream>
#include <numeric>
#include <cmath>
#include <algorithm>
#include <vector>

using namespace std;

#define sp ' '
#define st first
#define nd second
#define pb push_back
#define mp make_pair
#define forn(YY, yy) for(long long int yy = 0; yy < YY; ++yy)
#define prn(XX) cout << XX << endl
#define prs(XX) cout << XX << " "

typedef long long int ll;
typedef unsigned long long int ull;
typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef pair<ll, ll> pll;
typedef vector<pll> vpll;

const int MOD = 1e9 + 7;
const int INF = 2e9 + 13;
const int mINF = -2e9 - 13;
const double PI = 3.14159265358979;
const double EPS = 1e-9;

vector<vector<int>> grid;

int main(int argc, char **argv){
    ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);

    int N, M; cin >> N >> M;
    grid.resize(N, vector<int>(M));
    for(int i = 0; i < N; ++i)
        for(int j = 0; j < M; ++j)
            cin >> grid[i][j];

    int Q; cin >> Q;
    while(Q--){
        vector<pair<int, int>> p;
        int ans = 0;
        for(int i = 0; i < M; ++i){ int q; cin >> q; if(q != -1) p.pb(mp(i, q)); }
        for(int i = 0; i < N; ++i){
            bool uygun = true;
            for(int j = 0; j < (int)p.size(); ++j){
                if(grid[i][p[j].st] != p[j].nd){ uygun = false; break; }
            }
            if(uygun) ans++;
        }
        cout << ans << endl;
    }

    return 0;
}

//cikisir

• Subtask 1: 50 / 50