제출 #1160741

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1160741		Paul_Liao_1457	JOI 문장 (JOI14_ho_t1)	C++20	100 / 100	109 ms	2340 KiB

2014_ho_t1

#include <iostream>

using namespace std;

string flag[1005], emblem[5];

int match(int i, int j) {
    for (int k = 0; k < 4; k++) {
        if (flag[i+k/2][j+k%2] != emblem[k/2][k%2]) return 0;
    }
    return 1;
}

int main() {
    int m, n; cin >> m >> n;

    for (int i = 0; i < m; i++) {
        cin >> flag[i];
        flag[i] += '?';
    }

    for (int i = 0; i < 2; i++) {
        cin >> emblem[i];
    }

    int ans = 0;

    for (int i = 0; i < m-1; i++) {
        for (int j = 0; j < n-1; j++) {
            ans += match(i, j);
        }
    }

    int old_ans = ans;

    char cand[3] = {'J', 'O', 'I'};

    for (int i = 0; i < m; i++) {
        for (int j = 0; j < n; j++) {
            for (int k = 0; k < 3; k++) {

                int diff = 0;

                for (int di = -1; di < 1; di++) {
                    for (int dj = -1; dj < 1; dj++) {
                        if (i + di >= m || j + dj >= n) continue;
                        if (i + di < 0 || j + dj < 0) continue;

                        int init_match = match(i+di, j+dj);

                        char init = flag[i][j];
                        flag[i][j] = cand[k];

                        int new_match = match(i+di, j+dj);

                        diff += new_match - init_match;

                        flag[i][j] = init;
                    }
                }

                ans = max(ans, old_ans + diff);
            }
        }
    }

    cout << ans << endl;
}

• Subtask 1: 30 / 30
• Subtask 2: 70 / 70