Submission #1972268

---

Source Code Expand

#include <iostream>
#include <vector>
#include <string>
using namespace std;
 
#define FOR(i,s,e) for(int i = (s);i <= (e);i++)
 
int N;
int M;
 
string flag[1000];
string emblem[2];
 
bool issame[1000][1000];
 
 
int none_cou = 0;
int main()
{
 
    cin >> M >> N;
 
    FOR(i,0,M - 1)
    {
        cin >> flag[i];
    }
    FOR(i,0,1)
    {
        cin >> emblem[i];
    }
    FOR(i,0,M - 2)
    {
        FOR(j,0,N - 2)
        {
            bool same = true;
            FOR(k,0,1)
            {
                FOR(l,0,1)
                {
                    same = same && (flag[i + k][j + l] == emblem[k][l]);
                }
            }
 
            issame[i][j] = same;
            if(same)
            {
                none_cou++;
            }
        }
    }
 
    int result = none_cou;
 
    string JOI = "JOI";
    FOR(mi,0,M - 1)
    {
        FOR(ni,0,N - 1)
        {
            int cou = 0;
            for(char c : JOI)
            {
                int cou = none_cou;
                FOR(m,max(mi - 1,0),min(mi,M - 2))
                {
                    FOR(n,max(ni - 1,0),min(ni,N - 2))
                    { 
                        bool same = true;
                        FOR(k,0,1)
                        {
                            FOR(l,0,1)
                            {
                                if(!(0 <= m + k && m + k < M && 0 <= n + l && n + l < N))
                                {
                                    same = false;
                                    break;
                                }
 
                                char tmp = flag[m + k][n + l];
                                if(m + k == mi && n + l == ni) tmp = c;
                                same = same && (emblem[k][l] == tmp);
                            }
                        }
                        if(same && (issame[m][n] == false))
                        {
                            cou++;
                        }
                        if( !same && issame[m][n])
                        {
                            cou--;
                        }
 
                    }
                }
                result = max(result,cou);
                if(result == cou)
                {
                }
            }
        }
    }
 
    cout  << result << endl;
    return 0;
 
}

Submission Info

Judge Result