Submission #5875413

---

Source Code Expand

#include <iostream>
#include <stdio.h>
#include <string>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <math.h>
#include <vector>
#include <algorithm>
#include <queue>
#include <stack>
#include <climits>
#include <bitset>
#include <list>
#include <map>
#include <set>

using namespace std;

typedef unsigned long long ull;
typedef long long ll;

int main(){
	int n, m;
	cin >> n >> m;
	int a[n][m], b[n][m];
	for(int i=0; i<n; i++){
		string s;
		cin >> s;
		for(int j=0; j<m; j++){
			a[i][j]=0;
			b[i][j]=s[j]-'0';
		}
	}
	for(int i=1; i<n-1; i++){
		for(int j=1; j<m-1; j++){
			int t=min({b[i-1][j], b[i][j-1], b[i][j+1], b[i+1][j]});
			if(t!=0){
				b[i-1][j]-=t;
				b[i][j-1]-=t;
				b[i][j+1]-=t;
				b[i+1][j]-=t;
				a[i][j]+=t;
			}
		}
	}
	for(int i=0; i<n; i++){
		for(int j=0; j<m; j++){
			cout << a[i][j];
		}
		cout << endl;
	}
	return 0;
}

Submission Info

Judge Result