Submission #2790414

---

Source Code Expand

#include <iostream>
#include <cassert>
#include <climits>
#include <bitset>
#include <stack>
#include <queue>
#include <iomanip>
#include <limits>
#include <string>
#include <cmath>
#include <set>
#include <map>
#include <math.h>
#include <algorithm>
#include <vector>
#include <string.h>
 
using namespace std;
typedef long long ll;
 
 
typedef pair<ll,ll> P;
long long int INF = 1e18;
double Pi = 3.141592653589;
const int mod = 1000000007;
// memset(a,0,sizeof(a)); →全部０にする
 
vector<ll> G[100005];
std::vector<P> tree[100010];
 
int dx[8]={1,0,-1,0,1,1,-1,-1};
int dy[8]={0,1,0,-1,1,-1,-1,1};
 
#define p(x) cout<<x<<endl;
#define el cout<<endl;
#define pe(x) cout<<x<<" ";
#define ps(x) cout<<fixed<<setprecision(25)<<x<<endl;
#define re(i,a,b) for(i=a;i<=b;i++);
#define pb push_back
#define lb lower_bound
#define ub upper_bound
 
ll i,j,k,ii,jj;
ll n,m,sum,num;
ll a,b,c,d,e,ans;
ll x[500005],y[500005],z[100005];
ll ma,mi;
char s[100005];
ll dp[1005][1005],kan[1005][1005]; 

int main(){
	cin>>n>>m;
	for(i=0;i<n;i++){
		cin>>s;
		for(j=0;j<m;j++){
			dp[i][j] = (ll)(s[j]-'0');
		}
	}
	for(i=1;i<n-1;i++){
		for(j=1;j<m-1;j++){
			for(k=0;k<4;k++){
				x[k]=dp[i+dx[k]][j+dy[k]];
			}
			sort(x,x+4);
			a = x[0];
			assert(a>=1);
			kan[i][j] = a;
			for(k=0;k<4;k++){
				dp[i+dx[k]][j+dy[k]] -= a;
			}
		}
	}
	for(i=0;i<n;i++){
		for(j=0;j<m;j++){
			cout<<kan[i][j];
		}
		el;
	}
	return 0;

	
}

Submission Info

Judge Result