Codeforces 525D Arthur and Walls 【DFS】

题目链接：Codeforces 525D Arthur and Walls

D. Arthur and Walls
time limit per test2 seconds
memory limit per test512 megabytes
inputstandard input
outputstandard 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
…..
…..
…..
…..

题意：给定一个n*m 的格子，其中’.’表示土地，’*’表示墙，你需要去掉最少数目的墙(去掉后变成’.’)使得’.’所连通的图形均是矩形。

思路：考虑一个特殊的情况，2*2的子矩形里面如果有一个字符是 * 说明我们需要修改字符 *。那么直接扫描一遍就好了，因为修改后会影响到周围8个格子，那么直接DFS就可以了。

AC代码：

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <queue>
#define CLR(a, b) memset(a, (b), sizeof(a))
using namespace std;
typedef long long LL;
typedef pair<int, int> pii;
const int MAXN = 1e6 + 10;
const int MOD = 1e9 + 7;
const int INF = 0x3f3f3f3f;
char str[2010][2010];
int n, m;
bool Check(int x, int y) {
    return x >= 1 && x <= n && y >= 1 && y <= m;
}
int Count(int x, int y) {
    if(Check(x, y)) {
        return str[x][y] == '.';
    }
    return 0;
}
bool judge(int x, int y) {
    int cnt = 0;
    cnt = Count(x-1, y) + Count(x, y-1) + Count(x-1, y-1);
    if(cnt == 3) return true;
    cnt = Count(x, y+1) + Count(x-1, y) + Count(x-1, y+1);
    if(cnt == 3) return true;
    cnt = Count(x, y-1) + Count(x+1, y-1) + Count(x+1, y);
    if(cnt == 3) return true;
    return Count(x, y+1) + Count(x+1, y) + Count(x+1, y+1) == 3;
}
void Solve(int x, int y) {
    for(int i = -1; i <= 1; i++) {
        for(int j = -1; j <= 1; j++) {
            if(i == 0 && j == 0) continue;
            if(Check(x + i, y + j) && str[x + i][y + j] == '*' && judge(x + i, y + j)) {
                str[x + i][y + j] = '.';
                Solve(x + i, y + j);
            }
        }
    }
}
int main()
{
    while(scanf("%d%d", &n, &m) != EOF) {
        for(int i = 1; i <= n; i++) {
            scanf("%s", str[i]+1);
        }
        for(int i = 1; i <= n; i++) {
            for(int j = 1; j <= m; j++) {
                if(str[i][j] == '*') {
                    if(judge(i, j)) {
                        str[i][j] = '.';
                        Solve(i, j);
                    }
                }
            }
        }
        for(int i = 1; i <= n; i++) {
            printf("%s\n", str[i]+1);
        }
    }
    return 0;
}