Submission #1520761

---

Source Code Expand

#include<iostream>
#include<iomanip>
#include<math.h>
#include<vector>
#include<algorithm>
#include<set>
#include<map>
#include<queue>
#include<stack>
#include<string>
#include<complex>
#include<unordered_map>

#define INF 1000000000ll
#define MOD 1000000007ll
#define EPS 1e-8

#define REP(i, m) for(long long i = 0; i < m; ++i)
#define FOR(i, n, m) for(long long i = n; i < m; ++i)
#define ALL(v) v.begin(), v.end()
#define pb push_back

using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef long double ld;

int main() {
	int h,w;
	cin>>h>>w;
	vector<string> s(h);
	REP(i,h) cin>>s[i];
	REP(i,h) {
		REP(j,w) {
			if(s[i][j]=='.') {
				for(int dh=-1;dh<=1;++dh) {
					for(int dw=-1;dw<=1;++dw) {
						if(i+dh>=0&&i+dh<h&&j+dw>=0&&j+dw<w&&s[i+dh][j+dw]=='#') {
							s[i+dh][j+dw]='k';
						}
					}
				}
			}
		}
	}
	bool d=true;
	REP(i,h) {
		REP(j,w) {
			if(s[i][j]=='k') {
				bool f=false;
				for(int dh=-1;dh<=1;++dh) {
					for(int dw=-1;dw<=1;++dw) {
						if(i+dh>=0&&i+dh<h&&j+dw>=0&&j+dw<w&&s[i+dh][j+dw]=='#') {
							f=true;
						}
					}
				}
				if(!f) d=false;
			}
		}
	}
	if(!d) cout<<"impossible"<<endl;
	else {
		cout<<"possible"<<endl;
		REP(i,h) REP(j,w) if(s[i][j]=='k') s[i][j]='.';
		REP(i,h) cout<<s[i]<<endl;
	}
}

Submission Info

Judge Result