Submission #3239788

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

//macro-----------------------------------------------------------------------------------------
#define rep(i,a,b) for(int i=a;i<b;i++)
#define int long long
const int inf = 100100100100000;
const int mod = 1000000007;

//general_method--------------------------------------------------------------------------------
vector<int> cs(vector<int> arr){vector<int> ret = arr;rep(i,1,arr.size()){ret[i] += ret[i-1];}return ret;}

//io_method-------------------------------------------------------------------------------------
//int input(){int tmp;cin >> tmp;return tmp;}

int input(){
    char c; cin >> c;
    switch(c){
    case '0': return 0;
    case '1': return 1;
    case '2': return 2;
    case '3': return 3;
    case '4': return 4;
    case '5': return 5;
    case '6': return 6;
    case '7': return 7;
    case '8': return 8;
    case '9': return 9;
    default : return -1;
  }
}
string raw_input(){string tmp;cin >> tmp;return tmp;}
void print(int n){cout << n << endl;}
void print(vector<int> arr){cout << arr[0];rep(i,1,arr.size()) cout << " " << arr[i];cout << endl;}
void print(string s){cout << s << endl;}

//main_method-----------------------------------------------------------------------------------
struct UnionFind {
    vector<int> par; // 親ノード
    vector<int> rank; // ランク

    UnionFind(int n = 1) {
        init(n);
    }

    void init(int n = 1) {
        par.resize(n); rank.resize(n);
        for (int i = 0; i < n; ++i) par[i] = i, rank[i] = 0;
    }

    int root(int x) {
        if (par[x] == x) {
            return x;
        }
        else {
            int r = root(par[x]);
            return par[x] = r;
        }
    }

    bool issame(int x, int y) {
        return root(x) == root(y);
    }

    bool merge(int x, int y) {
        x = root(x); y = root(y);
        if (x == y) return false;
        if (rank[x] < rank[y]) swap(x, y);
        if (rank[x] == rank[y]) ++rank[x];
        par[y] = x;
        return true;
    }
};


signed main(){
    std::ios::sync_with_stdio(false);
    std::cin.tie(0);

    int h = input(), w = input();


    int field[h][w];
    rep(i,0,h){
        rep(j,0,w){
            field[i][j] = input();
        }
    }
    int ans[h][w]; rep(i,0,h)rep(j,0,w)ans[i][j] = 0;

    rep(i,1,h-1){
        rep(j,1,w-1){
            int t = min({field[i-1][j], field[i+1][j], field[i][j-1], field[i][j+1]});
            ans[i][j] = t;
        }
    }

    rep(i,0,h){
        rep(j,0,w){
            cout << ans[i][j];
        }
        cout << endl;
    }


    
}

Submission Info

Judge Result