Submission #3726288

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define REP(i, t) for(int i = 0; i < t; i++)

int db[510][510];
int ans[510][510] = {0};
int main()
{
    int N, M;
    cin >> N >> M;
    char c;
    REP(i, N)
    {
        REP(j, M) 
        {
            cin >> c, db[i][j] = c - '0';
        }
    }
    //データ加工終わり
    int minus_val = 0;

    for(int i = 1; i < N - 1; i++)
    {
        for(int j = 1; j < M - 1; j++)
        {
            if(0 < db[i - 1][j] * db[i][j - 1] * db[i][j + 1] * db[i + 1][j])
            {
                minus_val = min(min(db[i - 1][j], db[i][j - 1]), min(db[i][j + 1], db[i + 1][j]));
                db[i - 1][j]-=minus_val;
                db[i][j - 1]-=minus_val;
                db[i][j + 1]-=minus_val;
                db[i + 1][j]-=minus_val;
                ans[i][j]+=minus_val;
            }
        }
    }

    REP(i, N)
    {
        REP(j, M)
        {
            cout << ans[i][j];
        }
        cout << endl;
    }

    return 0;
}

Submission Info

Judge Result