DFS（思维） CodeForces - 525D Arthur and Walls

D. Arthur and Walls

time limit per test

2 seconds

memory limit per test

512 megabytes

input

standard input

output

standard output

Finally it is a day when Arthur has enough money for buying an apartment. He found a great option close to the center of the city with a nice price.

Plan of the apartment found by Arthur looks like a rectangle n × m consisting of squares of size 1 × 1. Each of those squares contains either a wall (such square is denoted by a symbol "*" on the plan) or a free space (such square is denoted on the plan by a symbol ".").

Room in an apartment is a maximal connected area consisting of free squares. Squares are considered adjacent if they share a common side.

The old Arthur dream is to live in an apartment where all rooms are rectangles. He asks you to calculate minimum number of walls you need to remove in order to achieve this goal. After removing a wall from a square it becomes a free square. While removing the walls it is possible that some rooms unite into a single one.

Input

The first line of the input contains two integers n, m (1 ≤ n, m ≤ 2000) denoting the size of the Arthur apartments.

Following n lines each contain m symbols — the plan of the apartment.

If the cell is denoted by a symbol "*" then it contains a wall.

If the cell is denoted by a symbol "." then it this cell is free from walls and also this cell is contained in some of the rooms.

Output

Output n rows each consisting of m symbols that show how the Arthur apartment plan should look like after deleting the minimum number of walls in order to make each room (maximum connected area free from walls) be a rectangle.

If there are several possible answers, output any of them.

Examples

Input

5 5
.*.*.
*****
.*.*.
*****
.*.*.

Output

.*.*.
*****
.*.*.
*****
.*.*.

Input

6 7
***.*.*
..*.*.*
*.*.*.*
*.*.*.*
..*...*
*******

Output

***...*
..*...*
..*...*
..*...*
..*...*
*******

Input

4 5
.....
.....
..***
..*..

Output

.....
.....
.....
.....

题目意思：给一个矩阵，要求将' * ' 改成' . ' 使其中的' . '连通块都是矩形，求改变的最小数量。

思考：考虑一个四格图，若其中一个格给’ * ‘ 而其他为’ .  ‘，那么这个' * '就是需要改变的点。从而推出在整张图中需要改变的点的条件。

具体参考代码：

#include <iostream>
#include <cstdio>
#include <cstring>

using namespace std;
char ch[2050][2050];
int n, m;
// 判断是否出界
bool Judge(int x, int y) {
    if(x >= 0 && x < n && y >= 0 && y < m) return true;
    return false;
}
// 判断‘.' 是否形成一个直角且包住一个'*' 号
bool culnum(int x, int y) {
    if(ch[x-1][y-1] == '.' && ch[x][y-1] == '.' && ch[x-1][y] == '.' && Judge(x-1, y-1)) return true;
    if(ch[x+1][y-1] == '.' && ch[x][y-1] == '.' && ch[x+1][y] == '.' && Judge(x+1, y-1)) return true;
    if(ch[x-1][y+1] == '.' && ch[x][y+1] == '.' && ch[x-1][y] == '.' && Judge(x-1, y+1)) return true;
    if(ch[x+1][y+1] == '.' && ch[x][y+1] == '.' && ch[x+1][y] == '.' && Judge(x+1, y+1)) return true;
    return false;
}

void dfs(int x, int y) {
    ch[x][y] = '.';
    for(int i = -1; i <= 1; i++) {
        for(int j = -1; j <= 1; j++) {
            int nx = x+i;
            int ny = y+j;
            if(Judge(nx, ny) && ch[nx][ny] == '*' && culnum(nx, ny)) {
                dfs(nx, ny);
            }
        }
    }
}
int main()
{
    scanf("%d%d", &n, &m);
    for(int i = 0; i < n; i++) {
        scanf("%s", ch[i]);
    }
    for(int i = 0; i < n; i++) {
        for(int j = 0; j < m; j++) {
            if(ch[i][j] == '*') {
                if(culnum(i, j)) {
                    dfs(i, j);
                }
            }
        }
    }
    for(int i = 0; i < n; i++) {
        printf("%s\n", ch[i]);
    }
    return 0;
}

解题想法来自：http://blog.csdn.net/bcwan_/article/details/54234348