B.Bombs(abc295)（模拟）

B - 炸弹 (atcoder.jp)

给定一个r*c的板子，上面‘.’表示空地，‘#’表示墙，数字代表上面有个炸弹，每个与当前数字格子的曼哈顿距离小于等于当前数字的地方都会变成空地

输入1 

4 4
.1.#
###.
.#2.
#.##
 

输出1

4 4
.1.#
###.
.#2.
#.##
 

输入2

2 5
..#.#
###.#
 

输出2

..#.#
###.#
 

输入3

2 3
11#
###
 

输出3

...
..#
 

输入4

4 6
#.#3#.
###.#.
##.###
#1..#.
 

输出4

......
#.....
#....#
....#.
 

#include <iostream>
#include <bits/stdc++.h>
#include <cstring>
#include <vector>
#include <unordered_map>
#include <queue>
#include <set>
#include <algorithm>
#define x first
#define y second
#define pb emplace_back
#define fu(i,a,b) for(int i=a;i<=b; ++ i)
#define fd(i,a,b) for(int i=a;i>=b;	-- i)
#define endl '\n'
#define ms(x,y) memset(x,y,sizeof x)
#define ios ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
using namespace std;

typedef long long LL;
typedef unsigned long long ULL;
typedef vector<vector<LL>> VVL;
typedef vector<vector<int>> VVI;
typedef vector<LL> VL;
typedef vector<int> VI;
typedef vector<string> VS;
typedef pair<int,int> PII;
typedef vector<PII> VPII;
typedef pair<PII,int> PIII;
typedef pair<double,double> PDD;
typedef pair<double,int> PDI;
typedef pair<char,int> PCI;
typedef pair<string,int> PSI;
typedef pair<int,string> PIS;
typedef pair<int,char> PIC;
typedef pair<LL,LL> PLL;
typedef __int128 i128;
typedef unsigned long long ULL;
const int N =20+ 10,M = N * 2,base =400  ,INF = 0x3f3f3f3f,P = 131;
const double eps = 1e-8;
const int mod = 998244353;
const LL LNF=(LL) INF * INF;


int n,m;
char g[N][N];
bool st[N][N]; // 判断每个格子是否要变成空地
inline void solve()
{
	cin >> n >> m ;
	
	fu(i,1,n) cin >> g[i] + 1; 
	
	fu(i,1,n)
	fu(j,1,m)
	if(g[i][j] >='1' && g[i][j] <='9')
	{
		int k = g[i][j] - '0';
		fu(a,1,n)
		fu(b,1,m)
		if(abs(a-i) + abs(b-j) <= k ) st[a][b] = 1;
	}
	
	fu(i,1,n)fu(j,1,m) if(st[i][j]) g[i][j] = '.';
	
	
	
		
	fu(i,1,n)cout << g[i]+1 <<endl;
	
		
	
		
}
signed main()
{
//  freopen("1.txt","r",stdin);
//	#define int long long 
    ios
//	cout << fixed<<setprecision(2);
    int t=1;
//    cin>>t;
    int now = 1;
    while(t -- )
    {
//      cout<<"Case "; 
//      cout<<"Case #"; 
//      cout<<"Scenario #"; 
//      cout<< now ++ <<": ";
//      cout<< now ++ <<": \n";
        solve();
    }


    return 0;
}