1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
| #include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<algorithm>
#include<queue>
using namespace std;
#define REP(i,e,s) for(register int i=e; i<=s; i++)
#define DREP(i,e,s) for(register int i=e; i>=s; i--)
#define ll long long
#define DE(...) fprintf(stderr,__VA_ARGS__)
#define DEBUG(a) DE("DEBUG: %d\n",a)
int read() {
int x=0,f=1,ch=getchar();
while(ch>'9'||ch<'0'){if(ch=='-')f=-1;ch=getchar();}
while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
return x*f;
}
const int MAXN=2000+10;
char a[MAXN][MAXN];
queue<pair<int,int> > q;
int n,m;
int tx[]={0,1,-1,1,-1};
int ty[]={0,-1,1,1,-1};
void bfs() {
while(!q.empty()) {
int x=q.front().first,y=q.front().second;
q.pop();
REP(i,1,4) {
int xx=x+tx[i],yy=y+ty[i];
if(xx>n||yy>m||xx<1||yy<1) continue;
if(a[x][yy]+a[xx][y]+a[xx][yy]+a[x][y]==3*'.'+'*') {
if(a[x][yy]=='*') q.push(make_pair(x,yy)),a[x][yy]='.';
if(a[xx][y]=='*') q.push(make_pair(xx,y)),a[xx][y]='.';
if(a[xx][yy]=='*') q.push(make_pair(xx,yy)),a[xx][yy]='.';
}
}
}
}
int main() {
n=read(),m=read();
REP(i,1,n) {
REP(j,1,m) a[i][j]=getchar();
getchar();
}
REP(i,1,n) REP(j,1,m)
if(a[i][j]=='.') q.push(make_pair(i,j));
bfs();
REP(i,1,n) {REP(j,1,m) printf("%c",a[i][j]); puts("");}
}
|
