Submission #439121

---

Source Code Expand

#include <vector>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <limits>
#include <tuple>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <cstring>
#include <cassert>

typedef long long ll;
typedef unsigned long long ull;

#define FOR(i,a,b) for(int (i)=(a);i<(b);i++)
#define REP(i,n) FOR(i,0,n)
#define RANGE(vec) (vec).begin(),(vec).end()

using namespace std;


class B {
public:

    void solve(void) {
            int N,M;
            cin>>N>>M;
            vector<vector<int>> tile(N,vector<int>(M,0));
            REP(i, N)
            {
                string line;
                cin>>line;
                REP(j, M)
                    tile[i][j] = line[j]-'0';
            }

            vector<vector<int>> a(N, vector<int>(M,0));
            FOR(y, 1, N-1)
            FOR(x, 1, M-1)
            {
                int dx[] = {-1,0,1,0};
                int dy[] = {0,1,0,-1};
                int minN = (1<<30);
                REP(d, 4)
                {
                    int nx = x+dx[d];
                    int ny = y+dy[d];
                    minN = min(minN, tile[ny][nx]);
                }
                if (minN == 0)
                    continue;
                REP(d, 4)
                {
                    int nx = x+dx[d];
                    int ny = y+dy[d];
                    tile[ny][nx] -= minN;
                }
                a[y][x] += minN;
            }
            REP(i, N)
            {
                REP(j, M)
                    cout<<a[i][j];
                cout<<endl;
            }
    }
};

#if 1
int main(int argc, char *argv[])
{
        ios::sync_with_stdio(false);
        auto obj = new B();
        obj->solve();
        delete obj;
        return 0;
}
#endif

Submission Info

Judge Result