提出 #71832222

---

ソースコード 拡げる

#include <bits/stdc++.h>

#include <atcoder/all>

using namespace std;
using namespace atcoder;

#define int long long
#define ALL(x) (x).begin(), (x).end()
#define MAX(x) *max_element(ALL(x))
#define MIN(x) *min_element(ALL(x))

typedef pair<int, int> PI;
typedef pair<int, pair<int, int>> PII;
static const int INF = 1010000000000000017LL;
static const double eps = 1e-12;
static const double pi = 3.14159265358979323846;
static const int dx[4] = {1, -1, 0, 0};
static const int dy[4] = {0, 0, 1, -1};
static const int ddx[8] = {1, -1, 0, 0, 1, 1, -1, -1};
static const int ddy[8] = {0, 0, 1, -1, 1, -1, 1, -1};

template <class T>
inline bool chmin(T& a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template <class T>
inline bool chmax(T& a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

int H, W;
int N;

signed main() {
    cin >> H >> W >> N;
    vector<vector<int>> A(H, vector<int>(W));
    set<int> B;
    for (int i = 0; i < H; ++i) {
        for (int j = 0; j < W; ++j) {
            cin >> A[i][j];
        }
    }
    for (int i = 0; i < N; ++i) {
        int b;
        cin >> b;
        B.insert(b);
    }
    int ans = 0;
    for (int i = 0; i < H; ++i) {
        int cnt = 0;
        for (int j = 0; j < W; ++j) {
            if (B.contains(A[i][j])) {
                cnt++;
            }
        }
        chmax(ans, cnt);
    }
    cout << ans << endl;
}

提出情報

ジャッジ結果