Submission #763431

---

Source Code Expand

#define rep(i,n) FOR(i,0,n)
#define FOR(i,s,n) for(int (i)=(s);(i)<(s)+(n);(i)++)
#define PI 3.14159265359
#define inf 1000000000
#define TIMEd 2000000
#include <iostream>
#include <queue>
#include <string>
#include <vector>
#include <math.h>
#include<algorithm>
#include<stdio.h>
#include <set>
#include <map>
#include <numeric>
using namespace std;
typedef long long ll;
typedef pair<int,int> Pii;
typedef pair<int,ll> Pill;


int main(){
	int h,w;
	char cell[100][100],cell2[100][100],cell3[100][100];
	cin>>h>>w;
	rep(i,h){
		rep(j,w) cin>>cell[i][j];
	}
	rep(i,h){
		rep(j,w){
			bool check=0;
			FOR(k,-1,3){
				FOR(l,-1,3){
					if(i+k<0 || h<=i+k || j+l<0 || w<=j+l || check ) continue;
					if(cell[i+k][j+l]=='.')check=1;
				}
			}
			if(check==0)cell2[i][j]='#';
			else cell2[i][j]='.';
		}			
	}
	bool sumcheck=0;
	rep(i,h){
		rep(j,w){
			bool check=0;
			FOR(k,-1,3){
				FOR(l,-1,3){
					if(i+k<0 || h<=i+k || j+l<0 || w<=j+l ||check) continue;
					if(cell2[i+k][j+l]=='#') check=1;
				}
			}
			if(check==0)cell3[i][j]='.';
			else cell3[i][j]='#';
			if(cell[i][j]!=cell3[i][j])sumcheck=1;
		}			
	}
	if(sumcheck)cout<<"impossible"<<endl;
	else{
		cout<<"possible"<<endl;
		rep(i,h){
			rep(j,w) cout<<cell2[i][j];
			cout<<endl;
		}
	}
	return 0;
}

Submission Info

Judge Result